The number of consecutive subarrays whose leetcode/ product is less than k

Code

package com.xcrj;

/** *  The finger of the sword  Offer II 009.  The product is less than  K  Subarray  *  Given an array of positive integers  nums And integer  k , Please find out that the product in the array is less than  k  The number of successive subarrays of . * （ The array element product is less than k&& Array elements are continuous ） How many such arrays are there  */
public class Solution9 {
    
    /** *  The sliding window  * ！！！ Use different pointers to achieve different purposes  * i j It all points to 0 * j Move back until product>=s * i Move back until product<s * sum+=j-i+1 */
    public int numSubarrayProductLessThanK(int[] nums, int k) {
    
        int i = 0;
        int j = 0;
        int product = 1;
        int sum = 0;
        while (j < nums.length) {
    
            product *= nums[j];
            //  Input [1,2,3] 0 when ,product Always for 0,0/ Any number =0
            // i<j avoid i Keep adding ,i==j The length of the subarray is 1 Satisfy <k It's fine too 
            while (i <= j && product >= k) {
    
                product /= nums[i];
                i++;
            }
            sum += j - i + 1;
            j++;
        }
        return sum;
    }

    public static void main(String[] args) {
    
        Solution9 solution9 = new Solution9();
        System.out.println(solution9.numSubarrayProductLessThanK(new int[]{
    10, 5, 2, 6}, 100));
    }
}

Reference resources

author ：LeetCode-Solution
link ：https://leetcode.cn/problems/ZVAVXX/solution/cheng-ji-xiao-yu-k-de-zi-shu-zu-by-leetc-xqx8/
source ： Power button （LeetCode）