https://leetcode-cn.com/problems/minimum-size-subarray-sum/
思路:滑动窗口
int minSubArrayLen(int target, vector<int>& nums) {
if (nums.size() == 0) {
return 0;
}
int value = nums[0];
int start = 0;
int res = INT_MAX;
if (value >= target) {
if (value == target) {
return 1;
}
if (res > value) {
res = 1;
}
start = 1;
value = 0;
}
for (int i = 1; i < nums.size(); i++) {
if (value < target) {
value += nums[i];
}
while (value >= target) {
if (i - start + 1 < res) {
res = i - start + 1;
//cout << start << " " << i << endl;
}
value = value - nums[start++];
}
}
if (res == INT_MAX) {
return 0;
}
return res;
}