解题思路:
用滑动窗口来维护一个最小数组长度
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int size = nums.size();
int j = 0;
int sum = 0;
int lenth = 0;
int result = INT32_MAX;
for(int i = 0; i < size; i++){
sum += nums[i];
while(sum >= target){
lenth = i - j + 1;
result = result < lenth ? result : lenth;
sum -= nums[j++];
}
}
return result == INT32_MAX ? 0 : result;
return result;
}
};