典型的滑动窗口题型了,leetcode 第 76 题:最小覆盖子串(C++)_qq_32523711的博客-CSDN博客
class Solution {
public:
int minSubArrayLen(int s, vector<int>& nums) {
int len = INT_MAX;
int left = 0, right = 0;
int sum = 0;
while(right < nums.size()){
sum += nums[right];
++right;
while(sum >= s){
len = min(len, right-left);
sum -= nums[left];
++left;
}
}
return len == INT_MAX ? 0 : len;
}
};