class Solution {
public int lengthOfLongestSubstring(String s) {
int maxlength=0;
HashMap<Character,Integer> map=new HashMap<>();
for(int start=0,end=0;end<s.length();end++){
char alpha=s.charAt(end);
if(map.containsKey(alpha)){
start=Math.max(map.get(alpha),start);//更新初始位置
}
maxlength=Math.max(maxlength,end-start+1);
map.put(alpha,end+1);
}
return maxlength;
}
}
04-06
1490
07-23
8854