暴力解:
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int minlen = INT_MAX;
int sum = 0;
for(int i = 0; i < nums.size();i++){
sum = 0;
for(int j = i; j < nums.size();j++){
sum += nums[j];
if(sum>=target){
// cout<<"i"<<i<<"j"<<j<<endl;
minlen = min(j-i+1,minlen);
break;
}
}
}
if(minlen == INT_MAX) return 0;
return minlen;
}
};
滑动窗口:
class Solution {
public:
int minSubArrayLen(int target, vector<int>& nums) {
int minlen = INT_MAX;
int sum = 0;
int left = 0;
int right = 0;
while(right < nums.size()){
sum += nums[right];
while(sum >= target){
minlen = min(minlen, right - left + 1);
sum -= nums[left];
left++;
}
right++;
}
return minlen == INT_MAX? 0 : minlen;
}
};