Add to List 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.
  

  分析：

  注意是 contiguous  subarrays

  解法：

  class Solution {
  public int numSubarrayProductLessThanK(int[] nums, int k) {
  if(k<=1)
  return 0;
  int and=1;
  int count = 0;
  int left=0,right =0;
  for(int i =0;i<nums.length;i++){
  right = i;
  and *= nums[i];
  while(and >= k) and /= nums[left++];
  count += right - left +1;
  }
  return count;
  }
  }

  
  
  

最后

以上就是无限口红最近收集整理的关于Add to List 713. Subarray Product Less Than K的全部内容，更多相关Add内容请搜索靠谱客的其他文章。