剑指 Offer II 009. 乘积小于 K 的子数组（Java）

public static int numSubarrayProductLessThanK(int[] nums, int k) {
    int start = 0;
    int end = 0;
    int ans = 0;
    int product = 1;
    while (end < nums.length){
        product = product * nums[end];
        if (product < k){
            ans = ans+(end - start + 1);// 如果从start乘到end小于k，那么从start+1到end，start+2到end，.....,到end自身都小于k。
            System.out.println(start+" "+end+" "+product);
            end++;
        }
        if (product >= k){
            while (product >= k && start < end){
                product = product / nums[start];
                System.out.println(product);
                start++;
            }
            product = product / nums[end];
            if (start == end && nums[start] >= k){
                start++;
                end++;
                product = 1;
            }
        }
    }
    return ans;
}