leetcode---最长不重复子串

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.

1. 思路 1
   在遍历字符串过程中，碰到重复字符就意味着新的不重复子串的开始。所以我们要定义两个变量：len记录最长子串的长度，left记录当前子串的起始位置。

int max_len_of_unique_substr(std::string str) {
    char count[128] = {-1};
    int cur_len = 0, max_len = 0;
    for (int i = 0; i < str.size(); ++i) {
        if (count[str[i]] >= 0) {               //之前出现过该字符
            if (i - count[str[i]] > cur_len) {  //当前窗口不包含该字符
                cur_len ++;
            }
            else {                              //包含
                cur_len = i - count[str[i]];
            }
        }
        else {
            cur_len ++;
        }
        
        if(max_len < cur_len) {
            max_len = cur_len;
        }
        count[str[i]] = i;
    }
    return max_len;
}

3. 思路 2