713.-subarray-product-less-than-k.md

713. Subarray Product Less Than K

class Solution:
    def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int:
        ans = 0
        if k <= 1 : return ans
        l  = r = 0
        pro = 1
        while r < len(nums):
            pro *= nums[r]
            r += 1
            while pro >= k:                
                pro /= nums[l]
                l += 1
                
            ans += r - l
        return ans