双指针暴力解
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if(s.empty())return 0;
int n=s.length();
if(n==1)return 1;
int p=0;
int out=1;
for(int i=1;i<n;i++){
for(int j=p;j<i;j++){
if(s[j]==s[i]){
// cout<<j<<endl;
p=j+1;
}
}
out=max(out,i-p+1);
cout<<i<<" "<<p<<endl;
}
return out;
}
};
优化待更新中…