【leetcode每日刷题】【尺取法】713. Subarray Product Less Than K

Your are given an array of positive integers nums.

Count and print the number of (contiguous) subarrays where the product of all the elements in the subarray is less than k.

Example 1:

Input: nums = [10, 5, 2, 6], k = 100
Output: 8
Explanation: The 8 subarrays that have product less than 100 are: [10], [5], [2], [6], [10, 5], [5, 2], [2, 6], [5, 2, 6].
Note that [10, 5, 2] is not included as the product of 100 is not strictly less than k.

Note:

• 0 < nums.length <= 50000.
• 0 < nums[i] < 1000.
• 0 <= k < 10^6.

class num713 {
public int numSubarrayProductLessThanK(int[] nums, int k) {
if(k <= 1) return 0;
int prod = 1, ans = 0, left = 0;
for(int right=0; right< nums.length; right++){
prod *= nums[right];
while(prod >= k) prod /= nums[left++];
ans += right-left+1;
}
return ans;
}
public static void main(String[] args) {
num713 s = new num713();
int[] nums = {10, 5, 2, 6};
int
k = 100;
int result = s.numSubarrayProductLessThanK(nums, k);
System.out.println(result);
}
}

最后

以上就是甜美中心为你收集整理的【leetcode每日刷题】【尺取法】713. Subarray Product Less Than K的全部内容，希望文章能够帮你解决【leetcode每日刷题】【尺取法】713. Subarray Product Less Than K所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。