多么熟悉的——
滑动窗口
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if (!s.size())
return 0;
int left=0,right=1,max=0;
int len=s.size();
string ss="";
ss+=s[0];
while(left<=right)
{
while(ss.find(s[right])==string::npos&&right<len)
{
ss+=s[right];
right++;
}
max=max>(right-left)?max:(right-left);
left++;
if(left>s.size())
break;
ss=ss.substr(1);
}
return max;
}
};