classSolution{publicintlengthOfLongestSubstring(String s){
Map<Character, Integer> charMap =newHashMap<>();int ans =0;for(int start =0,end =0; end < s.length(); end++){
Character c = s.charAt(end);if(charMap.containsKey(c)){//此时c的value还未发生变化
start = Math.max(start, charMap.get(c));}
ans = Math.max(ans, end - start +1);
charMap.put(s.charAt(end), end +1);}return ans;}}