Minimum Size Subarray Sum LeetCode solution in Java

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