class Solution {
public:
int lengthOfLongestSubstring(string s) {
int point1, point2;//两个活动的指针
int maxnn = 0, max1, max2;//maxnn记录最大的值
point1 = 0; point2 = 0;//初始化
int j;//这个很关键
for (int i = 0; i < s.size(); i++)
{
int flag = 1;//如果查重失败就加
for (j = point1; j < i; j++)//查重
{
if (s[j] == s[i])
{
flag = 0;
break;
}
}
if (flag)
{
point2 = i;
if (point2 - point1 > maxnn)//增加
{
maxnn = point2 - point1;
}
}
else
{
if (point2 - point1 > maxnn)//更新maxnn
{
maxnn = point2 - point1;
}
point1 = j + 1;//去掉重复的地方
point2 = i;
}
}
return s.size() ? maxnn + 1: 0;//注意特殊情况的判断
}
};