标签：hashmap des get math character har esc int 参考
原题：
https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
参考：
解法：
class Solution { public int lengthOfLongestSubstring(String s) { HashMap<Character,Integer> map = new HashMap<>(); int res = 0, i = 0,left=0; while(i<s.length()) { char ch = s.charAt(i); if(map.containsKey(ch) && map.get(ch)>=left) left = map.get(ch)+1; else res = Math.max(res,i-left+1); map.put(ch,i++); } return res; } }
标签：hashmap des get math character har esc int 参考
原文地址：http://www.cnblogs.com/qlky/p/7686951.html
