*Leetcode 713. 乘积小于 K 的子数组

Posted 2023-03-12 Z-Pilgrim

https://leetcode.cn/problems/subarray-product-less-than-k/

主要是种数

class Solution 
public:
    int numSubarrayProductLessThanK(vector<int>& nums, int k) 
        int ans = 0;
        int i = 0, j = i, cur = nums[i];
        while(i <= j && j < nums.size()) 
            // printf("--->i=%d j=%d cur=%d ans=%d\\n", nums[i], nums[j], cur, ans);
            if(cur < k) 
                ans += j-i+1;
                // printf("i=%d j=%d cur=%d ans=%d\\n", nums[i], nums[j], cur, ans);
                j++;
                    if(j >= nums.size()) break;
                     cur *= nums[j];
             else 
                if(cur >= k) 
                    cur /= nums[i];
                    i++; 
                    if(i >= nums.size()) break;
                    if(i > j) 
                        j++;
                        if(j >= nums.size()) break;
                        cur *= nums[j];
                    
                 else 
                    j++;
                    if(j >= nums.size()) break;
                    cur *= nums[j];
                     
                
            
            
        
        return ans;
    
;