class Solution {
public:
int lengthOfLongestSubstring(string s) {
int n = s.length();
if (n == 0) {
return 0;
}
vector<int> store(128, 0);
int left = 0, ans = 0;
for (int i = 0; i < n; ++i) {
while (store[s[i]] >= 1) {
store[s[left]] -= 1;
++left;
}
store[s[i]] += 1;
ans = max(ans, i - left + 1);
}
return ans;
}
};
3. 无重复字符的最长子串
最新推荐文章于 2024-06-29 23:00:55 发布