Given a string, find the length of the longest substring without repeating characters.
Example 1:
Input: "abcabcbb" Output: 3 Explanation: The answer is"abc", with the length of 3.
Example 2:
Input: "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1.
Example 3:
Input: "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
题意:
输出最长连续无重复字符的子串长度
解题:
维护两个指针l,r,如果右指针这个字符没有在l —(r-1)区间中出现,统计数+1,并与答案比较,大于答案的话更新答案,如果出现了,那么左指针右移,直到l—(r-1)区间不包含当前字符。
代码:
int lengthOfLongestSubstring(char* s) {
int ans=0,sum=0;
int le=strlen(s),l=0,r=0;
if(le==0) return 0;
int *p=(int *)malloc(128*sizeof(int)); //记录当前字符有没有出现,128这个值是测出来的,题目没有说字符最大是多少,我交了几发之后发现128是能过的
for (int i=0;i<128;i++)
p[i]=0;
while(1)
{
if(p[s[r]]==0) //没有出现
{
sum++;
if(sum>ans) ans=sum;
p[s[r]]=1;
r++;
}
else
{
while(p[s[r]]==1) //出现
{
if(l<r) //当左指针位置小于右指针
{
p[s[l]]=0;
l++;
sum--;
}
}//如果l==r那么p[s[r]]一定就不会出现,因为我们还没有取r这个点,所以不会死循环
}
if(r==le||l==le) break; //当右指针超出范围,那么累积值不可能会再超过答案了
}
return ans;
}