1
class Solution:
2
    def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int:
3
        if k == 0 or k == 1:
4
            return 0
5
        p = 1
6
        ini = 0
7
        fin = 0
8
        n = len(nums)
9
        c = 0
10
        while fin < n:
11
            p = p * nums[fin]
12
            while p >= k:
13
                p = p // nums[ini]
14
                ini += 1
15

16
            n1 = fin - ini + 1
17
            c += n1
18
            fin += 1
19
        return c