题目3. 无重复字符的最长子串:
题解:
用ACII码表来统计字符出现的次数,》=1 则左指针右移使得满足不重复条件
代码:
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int len = s.length();
int l = 0, r = 0;
if(len <= 1){ return len;}
vector<int> index(128);
int res = 0;
while(r < len)
{
while(index[s[r]] >= 1)
{
index[s[l]]--;
l++;
}
index[s[r]]++;
res = max(res, r-l+1);
r++;
}
return res;
}
};