LeetCode 3.longest-substring-without-repeating-characters

Description:

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

先放代码再看思路

class Solution {
public:
int lengthOfLongestSubstring(string s) {
int n = s.length();
int i=0,j=0;
int maxLen = 0;
bool exist[256] = {false};  //表示字符是否出现过，ascii有256个
while(j<n){
if(!exist[s[j]]){
exist[s[j]] = true;
j++;
}else{
maxLen = max(maxLen, j-i);
while(s[i] != s[j]){
exist[s[i]] = false;
i++
}
i++;
j++;
}
}
return max(maxLen, j-i);
}
};

思路:

exist[256]表示字符是否在substring里出现过。

i,j指向substring的开头和结尾，在i不变的情况下后移j，有两种可能：

如果s[j]未在substring里出现过,则

exist[s[j]]=true

,表示这个字符在substring里出现了，并且j后移一位。

如果s[j]在substring里出现过，则更新maxLen，且后移j和i，j一定是后移一位，没什么好说的。但是i的后移却需要考虑下：既然在这一段substring里有重复的字符，好比

abcdec

，此时把i后移到

b

处是毫无意义的，因为两个

c

还是会重复,因此至少要把

i

移到

d

处,这就解释了

while(s[i] != s[j]){exist[s[i]] = false;i++}

.