Eric 的小站

1
class Solution {
2
public:
3
    int lengthOfLongestSubstring(string s) {
4
        if (s.size() == 1)
5
            return 1;
6
        std::unordered_set<char> Map;
7
        int left = 0, length = 0;
8
        for (int right = 0; right < s.size(); ++right) {
9
            while (Map.find(s[right]) != Map.end()) {
10
                Map.erase(s[left]);
11
                left++;
12
            }
13
            Map.insert(s[right]);
14
            length = max(right - left + 1, length);
15
        }
16
        return length;
17
    }
18
};