leetcode

0 class Solution {

1 public:

2 int minSubArrayLen(int target, const vector<int> &nums) {

3 int i = 0, j = 0, sum = 0, res = nums.size() + 1;

4 while (true) {

5 if (sum >= target) {

6 res = min(res, j - i);

7 sum -= nums[i++];

8 } else {

9 if (j == nums.size()) break;

10 sum += nums[j++];

11 }

12 }

13 if (res == nums.size() + 1) return 0;

14 return res;

15 }

16 };