blob: 0735fc7f982852f4d5a45c908927556f9f32f4e3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
#include "leetcode.h"
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if (s.size() == 0)
return 0;
map<char, int> charsInSub;
int ans = 0, j = 0;
for (int i = 0; i < s.size(); ++i) {
if (charsInSub.find(s[i]) != charsInSub.end())
charsInSub.find(s[i])->second++;
else
charsInSub.insert(pair<char, int>(s[i], 1));
while (charsInSub.find(s[i])->second > 1) {
charsInSub.find(s[j])->second--;
++j;
}
ans = ans >= i - j + 1 ? ans : i - j + 1;
}
return ans;
}
};
int main() {
Solution obj;
string s = "abcabcbb";
cout << obj.lengthOfLongestSubstring(s);
}
|