滑动窗口
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if(s.empty())return 0;
int n=s.size();
int out=0;
int slow=0,fast=0;
unordered_map<char,int>hashmap;
while(fast<n){
if(hashmap.count(s[fast])){
int temp=hashmap[s[fast]];
for(int i=slow;i<=temp;i++)hashmap.erase(s[i]);
slow=temp+1;
}
hashmap[s[fast]]=fast;
fast++;
out=max(out,fast-slow);
}
return out;
}
};