leetcode 3. Longest Substring Without Repeating Characters

题目描述：

滑动窗口+哈希表

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int len = s.size();
        int left = 0;
        int right = 0;
        int res = 0;
        unordered_set<char> window;
        while(right <len){
            if(window.contains(s[right])){
                res = max(res,(int)window.size());
                while(window.contains(s[right])){
                    window.erase(s[left++]);
                }
            }
            window.insert(s[right]);
            right++;
        }
        res = max(res,(int)window.size());
        return res;
    }
};