简单滑动窗口问题

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        unordered_set<char>se;
        int n=s.size();
        int l=-1,ans=0;
        for(int i=0;i<n;i++)
        {
            if(i!=0)
            {
                se.erase(s[i-1]);
            }
            while(l+1<n&&se.count(s[l+1])==0)
            {
                se.insert(s[l+1]);
                ++l;
            }
            int maxn=se.size();
            ans=max(ans,maxn);
        }
        return ans;

    }
};