欢迎访问原文所在博客:52Heartz’s Blog
解答1[Java]:
class Solution {
public int lengthOfLongestSubstring(String s) {
int[] freq = new int[256];
int l = 0;
int r = -1;
int res = 0;
while (l < s.length()) {
if (r + 1 >= s.length()) {
break;
} else if (r + 1 < s.length() && freq[s.charAt(r + 1)] == 0) {
freq[s.charAt(++r)]++;
} else {
freq[s.charAt(l++)]--;
}
res = max(res, r - l + 1);
}
return res;
}
private int max(int a, int b) {
return a > b ? a : b;
}
}
思路
动态窗口