一、题目
二、题解
双指针+哈希 滑动窗口
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int left = 0, right = 0, ans = 0, n = s.size(), hash[128];
for (int i = 0; i < 128; i++) hash[i] = 0;
while (right < n) {
hash[s[right]]++;
while(hash[s[right]] > 1) hash[s[left++]]--;
ans = max(ans, (right++) - left + 1);
}
return ans;
}
};