滑动窗口class Solution {public int lengthOfLongestSubstring(String s) {if (s.length()0) return 0;HashMapCharacter,Integer map new HashMapCharacter,Integer();int max 0;int left 0;for(int i 0; i s.length(); 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-left1);}return max;}}
滑动窗口class Solution {public int lengthOfLongestSubstring(String s) {if (s.length()0) return 0;HashMapCharacter,Integer map new HashMapCharacter,Integer();int max 0;int left 0;for(int i 0; i s.length(); 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-left1);}return max;}}
（支持资料、图片参考_相关定制）_文章底部可以扫码)
![[C++]内存管理：串顺序存储的内存回收](http://pic.xiahunao.cn/yaotu/[C++]内存管理：串顺序存储的内存回收)
