int lengthOfLongestSubstring(char *s)//const
{
int start=0, end=0, maxlen=0, len=0, array_map[128]={0};
len = strlen(s);
if(0 == len || 1 == len)
{
return len;
}
while(0 != s[end])
{
while(0 != array_map[s[end]])
{
array_map[s[start]] = 0;
start++;
}
len = end - start + 1;
if(len > maxlen)
{
maxlen = len;
}
array_map[s[end]] = 1;
end++;
}
return maxlen;
}
无重复字符的最长子串
最新推荐文章于 2023-09-18 00:10:46 发布