leetcode 3 无重复字符的最长子串

滑动窗口

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        unordered_set<char> charSet;
        int left = 0;
        int right = 0;
        int len = s.size();
        int ans = 0;
        int temp = 0;
        while(left < len && right < len)
        {
            if(charSet.contains(s.at(right)))
            {
                temp = charSet.size();
                ans = max(temp,ans);
                charSet.erase(s.at(left++));
            }
            else
            {
                charSet.insert(s.at(right++));
            }
        }
        return ans;
    }
};