713.Subarray Product Less Than K

• 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.

• 題目大意：給定一個非負數組，計算子序列的乘積小于k。
• 思路：滑動視窗。
• 代碼：

package Array;    
  /**
   * @Author OovEver
   * @Date 2017/11/28 10:10
   */
  public class Solution {
      public int numSubarrayProductLessThanK(int[] nums, int k) {
          if (k < ) {
              return ;
          }
          int result = ;
          int product = ;
          for(int i=,right=;right<nums.length;right++) {
              product *= nums[right];
              while (i <= right && product >= k) {
                  product /= nums[i++];
              }
              result += right - i + ;
          }
          return result;
      }
  }