Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

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.

---

想法

最长的字串会在两个相同的字母之间，记录下两个重复字母之间的length之后从这一字母上次出现的下一个位置开始寻找，减小了算法的时间复杂度。
1. 首先可以用一个vector类型的数据结构，大小为256可以涵盖所有的字符用来记录是否已经出现过这个字符。
2. 若重复出现过某一个字符，当前的len = i-start,通过循环退回到上一次出现该字母的下一个位置;
3. 最后在比较一下出现到了最后没有循环的一个字串的长度

代码

class Solution {
public:
int lengthOfLongestSubstring(string s) {
    if (s.length() < 2){
        return s.length();
    }
    vector<int> dict(256, -1);
    int start = 0;
    int res = 1;
    for (int i = 0; i < s.length(); i++){
        if (dict[s[i]] != -1){
            res = max(res, i - start);
            for (int j = start; j < i; j++){
                if (s[i] == s[j]){
                    start = j + 1;
                    break;
                }
                dict[j] = -1;
            }
        }
        else{
            dict[s[i]] = 1;
        }
    }
    res = res>s.length() - start ? res : s.length()-start;
    return res;
}
};