class Solution {
public:
int lengthOfLongestSubstring(string s) {
int freq[256] = {0};
int l = 0;
int r = -1;
int res = 0;
while (l<s.size())
{
if ((r + 1) < s.size() && freq[s[r + 1]] == 0)
{
r++;
freq[s[r]]++;
}
else
{
freq[s[l]]--;
l++;
}
res = max(res, r - l + 1);
}
return res;
}
};
3_无重复字符的最长字符串
最新推荐文章于 2023-07-05 13:42:39 发布