Time: 1 ms (99.98%), Space: 41.9 MB (9.31%) - LeetHub

Author: cmcoffeedev

minimum-size-subarray-sum/minimum-size-subarray-sum.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int minSubArrayLen(int target, int[] nums) {
+        
+        int minLength = Integer.MAX_VALUE;
+        int left = 0;
+        int sum = 0;
+        for(int right = 0;right < nums.length;right++){
+            sum += nums[right];
+            while(sum >= target){
+                minLength = Math.min( minLength, (right - left) + 1 );
+                sum -= nums[left++];
+            }
+        }
+        
+        return minLength == Integer.MAX_VALUE ? 0 : minLength;
+    }
+}