各位大神帮我看看这个Longest Substring Without Repeating Characters怎么错了啊
class Solution {
public:
int lengthOfLongestSubstring(string s) {
string::iterator start=s.begin(),end=s.begin();
vector<int> iv;
while(end!=s.end())
{
if(*end==*(end+1))
{
end++;
start++;
}
if(*end!=*(end+1))
{
end++;
}
iv.push_back(end-start+1);
for(auto i=start;i<end;i++)
{
if(*(end+1)==*i)
{
start=end+1;
end=start;
}
}
}
return *max_element(iv.begin(),iv.end());
}
};