class Solution {
public:
int lengthOfLongestSubstring(string s) {
int left = 0;
int right = 0;
int ret = 0;
unordered_map<char,int> hash;
while(right < s.size()){
hash[s[right]]++;
while(hash[s[right]] > 1){
hash[s[left++]]--;
}
ret = max(ret,right-left+1);
right++;
}
return ret;
}
};
无重复字符的最长子串
于 2023-03-01 14:09:59 首次发布