Minimum Size Subarray Sum

1public int minSubArrayLen(int target, int[] nums) {
2    int minLen = Integer.MAX_VALUE;
3    int left = 0;
4    int currentSum = 0;
5
6    for (int right = 0; right < nums.length; right++) {
7        currentSum += nums[right];
8
9        while (currentSum >= target) {
10            minLen = Math.min(minLen, right - left + 1);
11            currentSum -= nums[left];
12            left++;
13        }
14    }
15
16    return minLen == Integer.MAX_VALUE ? 0 : minLen;
17}