自己写的暴力解法:
public int lengthOfLongestSubstring(String s) {
int index =0;//初始下标
int max =0;
StringBuilder sb = new StringBuilder();
for(int i=0;i<s.length();i++){
if(!sb.toString().contains(String.valueOf(s.charAt(i)))){
sb.append(s.charAt(i));
}else{
index+=1;
i =index;
max=sb.length()>max?sb.length():max;
sb = new StringBuilder();
sb.append(s.charAt(index));
}
}
max=sb.length()>max?sb.length():max;
return max;
}
评论区学习到的更优解:
// 记录字符上一次出现的位置
int[] last = new int[128];
int n = s.length();
int res = 0;
int start = 0; // 窗口开始位置
for(int i = 0; i < n; i++) {
int index = s.charAt(i);
start = Math.max(start, last[index]);
res = Math.max(res, i - start + 1);
last[index] = i+1;
}
return res;