public static int lengthOfLongestSubstring(String s) {
int n = s.length();
int l = 0;
int r = 0;
int length = 0;
Map<Character, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++) {
char c = s.charAt(i);
r = i;
if (!map.isEmpty() && map.containsKey(c)) {
l = Math.max(map.get(c) + 1, l);
map.put(c, i);
}
map.put(c, i);
length = Math.max(r - l + 1, length);
}
return length;
}
Longest Substring Without Repeating Characters
最新推荐文章于 2018-08-09 12:44:17 发布