leetcode LongestSubstringWithoutRepeatingCharacters
z
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
import java.util.HashMap;

public class LongestSubstringWithoutRepeatingCharacters {
public int lengthOfLongestSubstring(String s) {
int ans = 0;
int start = 0;
HashMap<Character, Integer> m = new HashMap<>();
for (int i=0; i<s.length(); i++) {
if (m.containsKey(s.charAt(i))) {
start = Math.max(start, m.get(s.charAt(i))+1);
}
m.put(s.charAt(i), i);
ans = Math.max(ans, i-start+1);
}
return ans;
}
}