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

class Solution {
    public int numSubarrayProductLessThanK(int[] nums, int k) {
        if(k<=1)
            return 0;
        int count=0;
        int left=0;
        int prod=1;
        for(int r=0;r<nums.length;r++){
            prod*=nums[r];
            while(prod>=k){
                prod/=nums[left++];
            }
            count+=r-left+1;
        }
        return count;
    }
}