class Solution {
public:
int lengthOfLongestSubstring(string s) {
unordered_map<char,int> window;
int right = 0, left = 0;
int res = 0;
while(right<s.size()){
char c = s[right];
window[c]++;
right++;
while(window[c]>1){
char d = s[left];
left++;
window[d]--;
}
res = max(res,right-left);
}
return res;
}
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20