1
class Solution {
2
  public int numSubarrayProductLessThanK(int[] nums, int k) {
3
    int n = nums.length;
4
    long p = 1l;
5
    int i = 0;
6
    int j = 0;
7
    int total = 0;
8
    while (j < n) {
9
      p *= nums[j];
10
      while (i <= j && p >= k) {
11
        p /= nums[i];
12
        i++;
13
      }
14
      total += (j - i + 1);
15
      j++;
16
    }
17
    return total;
18
  }
19
}