class Solution {
public int numSubarrayProductLessThanK(int[] nums, int k) {
if(k == 0 || k == 1) return 0;
int left = 0;
int sum = 1, result = 0;
for(int right = 0; right < nums.length; right++){
sum = sum * nums[right];
while(sum >= k){
sum = sum/nums[left];
++left;
}
result += right - left + 1;
}
return result;
}
}
713.乘积小于K的子数组,滑动窗口0ms
最新推荐文章于 2024-10-01 05:04:32 发布