Leetcode 713. Subarray Product Less Than K

Leetcode 713. Subarray Product Less Than K

Input: nums = [10, 5, 2, 6], k = 100
Output: 8

index:0
[10], [10, 5], ans = 2
index: 1
[5], [5,2], [5,2,6], ans = 5
index: 2
[2], [2, 6], ans = 7
index: 3
[6], ans =8

Approach #2: Sliding Window [Accepted]

Input: nums = [10, 5, 2, 6], k = 100
Output: 8

right: 0
[10], ans =1
right: 1
[10,5], [5], ans =3
right: 2
[5,2], [2], ans = 5
right: 3
[5,2,6] ,[2,6], [6], ans =8

class Solution {
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;
System.out.println(ans);
}
return ans;
}
}

最后

以上就是生动吐司为你收集整理的Leetcode 713. Subarray Product Less Than K的全部内容，希望文章能够帮你解决Leetcode 713. Subarray Product Less Than K所遇到的程序开发问题。

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