Minimum Size Subarray Sum LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minSubArrayLen(int target, vector<int> &nums) {
4
    int m = INT_MAX, s = 0, l = 0;
5
    for (int i = 0; i < nums.size(); i++) {
6
      s += nums[i];
7
      if (s >= target) m = min(m, i - l + 1);
8
      while (s >= target) {
9
        m = min(m, i - l + 1);
10
        s -= nums[l++];
11
      }
12
    }
13
    if (m == INT_MAX) m = 0;
14
    return m;
15
  }
16
};