LeetCode 713. Subarray Product Less Than K(java)

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.

解题思路：找到所有结束在i的可能的解，i为从左向右遍历的index值，因此，通过这种思路，我们可以保证我们的inference（推理，reasoning）是完备的（complete），代码如下：

    public int numSubarrayProductLessThanK(int[] nums, int k) {
        if (k <= 0) return 0;
        int result = 0, pre = 1, start = 0;
        for (int i = 0; i < nums.length; i++) {
            pre = pre * nums[i];
            if (pre < k) {
                result += i - start + 1;
            } else {
                for (int j = start; j <= i; j++) {
                    pre = pre / nums[j];
                    if (pre < k || (j == i && pre >= k)) {
                        start = j + 1;
                        break;
                    }
                }
                result = result + i - start + 1;
            }
        }
        return result;
    }