Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
思路
这道题比之前的两题都要简单,思路就是一句话:用数组记录下来每个字符最后出现的位置。
要注意的地方有两个
数组的大小应该是256,那是因为对应的ASCII码有256个。
每次更新字符最后出现位置时,同时也要更新当前子串长度,要考虑上一次该字符是否出现在当前子串中。
比如"assdfgha"和"asdfgd"这两种情况下更新子串长度的方法是不一样的。
代码
class Solution {
public:
int lengthOfLongestSubstring(string s)
{
int ret = 0;
int len = 0;
int idx = -1;
int alphabet[256] = {0};
for (int i=0; i<256; ++i) alphabet[i] = -1;
const char* c = s.c_str();
while (*c)
{
idx = idx+1;
if (alphabet[*c] == -1)
{
len = len+1;
alphabet[*c] = idx;
}
else
{
len = (len+1>idx-alphabet[*c])?(idx-alphabet[*c]):(len+1); //important!
alphabet[*c] = idx;
}
ret = (len>ret)?len:ret;
c = c+1;
}
return ret;
}
};