Modified Subarray Product Less Than K.java

varunu28 · varunu28 · commit 9c70403ece79 · 2020-09-28T06:28:45.000-07:00
diff --git a/Medium/Subarray Product Less Than K.java b/Medium/Subarray Product Less Than K.java
@@ -1,15 +1,18 @@
 class Solution {
-    public int numSubarrayProductLessThanK(int[] nums, int k) {
-        if (k<2) return 0;
-        int result = 0;
-        int product = 1;
-        for (int i = 0, right = 0; right < nums.length; right++) {
-            product *= nums[right];
-            while (i < nums.length && product >= k) {
-                product /= nums[i++];
-            }
-            result += right - i + 1;
-        }
-        return result;
+  public int numSubarrayProductLessThanK(int[] nums, int k) {
+    if (k <= 1) {
+      return 0;
     }
+    int prod = 1;
+    int ans = 0;
+    int left = 0;
+    for (int right = 0; right < nums.length; right++) {
+      prod *= nums[right];
+      while (prod >= k) {
+        prod /= nums[left++];
+      }
+      ans += right - left + 1;
+    }
+    return ans;
+  }
 }
