[LeetCode] 3. Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

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

Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.

Example 2:

Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.

Example 3:

Input: “pwwkew”
Output: 3
Explanation: 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.

解析

找到最长的不重复的字符的子串的长度。
用一个hash表存储256个字符的位置，初始为-1，设置一个最大值maxlen和当前值curlen，初始都为0.
循环遍历字符串：
当前字符没有出现时，curlen++
当前字符已经出现时：获取当前位置和上一次出现的距离len：
如果len<=curlen，curlen=len; 否则curlen++;
存储当前字符位置，获得最大长度maxlen=max(curlen,maxlen);

代码

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int size = s.size();
        if(size==0)
            return 0;
        int *index = new int[256];
        for(int i=0;i<256;i++)
            index[i] = -1;
        int maxlen = 0;
        int curlen = 0;
        for(int i=0;i<size;i++){
            if(index[s[i]] < 0)
                curlen ++;
            else{
                int len = i-index[s[i]];
                if(len > curlen)
                    curlen ++;
                else
                    curlen = len;
            }
            index[s[i]] = i;
            maxlen = max(curlen,maxlen);
        }
        return maxlen;
    }
};