<pre name="code" class="cpp">int lengthOfLongestSubstring(string s)
{
const int N=256;
vector<int>lastpos(N),met(N);
int start=0,cur=start;
int len=0,maxlen=0;
for(; cur<s.size();++cur)
{
int ch=s[cur];
if(met[ch])
<span style="white-space:pre"> </span>for(; start<=lastpos[ch]; ++start,--len)
<span style="white-space:pre"> </span> met[s[start]]=0;
++len;
lastpos[ch]=cur;
met[ch]=1;
maxlen=max(maxlen,len);
}//for
return maxlen;
}
Longest Substring Without Repeating Characters
最新推荐文章于 2024-01-06 13:50:14 发布