思想 模板 209. 长度最小的子数组来自这个视频
class Solution {
public:
int minSubArrayLen(int target, vector nums) {
int left,right=0;
int curSum=0;
int minLen=0;
while(right
curSum+=nums.at(right);
while(curSum>=target){
if(right-left+1
minLen=right-left+1;
}
curSum-=nums.at(left);
left++;
}
right++;
}
return minLen;
}
};
3. 无重复字符的最长子串
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int left,right=0;
int maxLen=0;
unordered_map umap;
while(right
umap[s[right]]++;
while(umap[s[right]]!=1){
umap[s[left]]--;
left++;
}
maxLen=max(maxLen,right-left+1);
right++;
}
return maxLen;
}
};



