69,369
社区成员
发帖
与我相关
我的任务
分享
int lengthOfLongestSubstring(char* s) {
int maxLen = 0;
int len = 0;
char *p = s; //当前位置
char *ps = s; //当前子串起始位置
char *pc = s; //循环比较
while('\0' != *p)
{
while(pc != p)
{
if(*pc == *p)
{
maxLen = maxLen > len?maxLen:len;
len = 0;
ps = ps++;
pc = ps;
p = ps;
break;
}
pc++;
}
p++;
len++;
pc = ps;
}
maxLen = maxLen > len?maxLen:len;
return maxLen;
}