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 Solution {
public:
    int numSubarrayProductLessThanK(vector<int>& nums, int k) {
        if(k<=1) return 0;
        //利用双指针，右指针每次移动一步，然后让左指针移动到符合条件的位置
        //而不是左指针每次移动一步，这样的话右指针又要从左指针处重新开始
        int i=0;
        int j=0;
        int product=1;
        int result=0;
        while(j<nums.size())
        {
            product*=nums[j];
            while(product>=k)
            {
                product/=nums[i];
                i++;
            }
            result+=j-i+1;
            j++;
        }
        return result;
    }
};