本题是滑动窗口+哈希表
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int ans = 0,left = 0;
unordered_map<char,int>hash;
for(int right = 0;right<s.size();++right){
hash[s[right]-'a']++;
while(hash[s[right]-'a']>1){
hash[s[left++]-'a']--;
}
ans = max(ans,right-left+1);
}
return ans;
}
};