Solution 滑动窗口
class Solution {
public int lengthOfLongestSubstring(String s) {
int len = s.length();
if (len <= 1) {
return len;
}
Map<Character, Integer> map = new HashMap<>();
int max = 0, left = 0;
for (int i = 0; i < len; i++) {
if (map.containsKey(s.charAt(i))) {
left = Math.max(left, map.get(s.charAt(i)) + 1);
}
map.put(s.charAt(i), i);
max = Math.max(max, i - left + 1);
}
return max;
}
}
810

被折叠的 条评论
为什么被折叠?



