题目:3. 无重复字符的最长子串 - 力扣(LeetCode)
水题
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if (s.empty()) return 0;
set<char> chars;
int l = 0;
int ret = 1;
chars.insert(s[0]);
for (int i = 1; i < s.length(); i++) {
while (chars.find(s[i]) != chars.end()) {
chars.erase(s[l]);
l++;
}
chars.insert(s[i]);
if (i - l + 1 > ret) {
ret = i - l + 1;
}
}
return ret;
}
};