713. Subarray Product Less Than K
2017-12-06 00:42
316 查看
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.
brute-force解法O(N*N), 超时无法通过。分析可知,在确定起始点后,如果依次往后scanning找到那个临界点后,可以知道这个起始点对应的子序列个数。起始点后移一位,并不需要重新开始逐个算乘积确定新的临界点。因为上一个起始点的计算可以再次利用。也就是sliding window的思想。
代码:
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.
brute-force解法O(N*N), 超时无法通过。分析可知,在确定起始点后,如果依次往后scanning找到那个临界点后,可以知道这个起始点对应的子序列个数。起始点后移一位,并不需要重新开始逐个算乘积确定新的临界点。因为上一个起始点的计算可以再次利用。也就是sliding window的思想。
代码:
class Solution { public: int numSubarrayProductLessThanK(vector<int>& nums, int k) { int len = nums.size(); if (k <= 1) return 0; int prod = 1; int cnt = 0; int left = 0; for (int right = 0; right < len; right++) { prod *= nums[right]; while (prod >= k) prod /= nums[left++]; cnt += right - left + 1; } return cnt; } };
相关文章推荐
- LeetCode 713. Subarray Product Less Than K(java)
- LWC 55:713. Subarray Product Less Than K
- leetcode 713. Subarray Product Less Than K 连续子数组之积小于K + 移动窗口
- leetcode 713. Subarray Product Less Than K & leetcode 467. Unique Substrings in Wraparound String
- [Leetcode] 713. Subarray Product Less Than K 解题报告
- 713. Subarray Product Less Than K
- LeetCode-713:Subarray Product Less Than K (乘积小于K的子数组个数) -- medium
- Leetcode:713.Subarray Product Less Than K
- LeetCode Subarray Product Less Than K
- 713. Subarray Product Less Than K
- Add to List 713. Subarray Product Less Than K
- leetcode 713 Subarray Product Less Than K
- leetcode 713. Subarray Product Less Than K
- Array-Subarray Product Less Than K
- Subarray Product Less Than K问题及解法
- Subarray Product Less Than K
- [LeetCode] Subarray Product Less Than K 子数组乘积小于K
- dandelion datatables : Page index must not be less than zero!
- 解决ORA-00600: internal error code, arguments: [kcratr_nab_less_than_odr]错误
- Mysql version can not be less than 4.1 出错解决办法