leetcode_longest_substring_without_repeating_characters

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