Java
class Solution {
public int numSubarrayProductLessThanK(int[] nums, int k) {
if(k<2) return 0;
int res=0,sum=1;
for(int sta=0,end=0;end<nums.length;end++){
sum*=nums[end];
while(sta<nums.length&&sum>=k){
sum/=nums[sta++];
}
res+=end-sta+1;
}
return res;
}
}
Python