LEETCODE 3. 无重复字符的最长子串

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        set<char> sett;
        int maxlength=0;
        int tmp=0;
        int j=0;
        for(int i=0;i<s.size();i++){
            if(sett.find(s[i])==sett.end()){
                sett.insert(s[i]);
                tmp+=1;
            }
            else{
                if(maxlength<tmp)
                    maxlength=tmp;
                tmp+=1;
                while(s[j]!=s[i]){
                    sett.erase(s[j]);
                    j+=1;
                    tmp-=1;
                    
                }
                j+=1;
                tmp-=1;
                
            }
        }
        if(maxlength<tmp)
            maxlength=tmp;
        return maxlength;
    }
};