3. Longest Substring Without Rep

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

Subscribe to see which companies asked this question

C++ Version:

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int result = 0;
        int length = s.length();
        int i = 0, j = 0;
        bool exist[256] = { false };
        while (j < length){
            if (exist[s[j]]) {  
                result = max(result, j-i);  
                while (s[i] != s[j]) {  
                    exist[s[i]] = false;  
                    i++;  
                }  
                i++;  
                j++;  
            } else {  
                exist[s[j]] = true;  
                j++;  
            }
            
        }        
        result = max(result, j-i);
        return result;
    }
};