public static int lengthOfLongestSubstring(String str) {
int n = str.length();
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
if (allUnique(str, i, j)) {
ans = Math.max(ans, j - i);
}
}
}
return ans;
}
public static boolean allUnique(String s, int start, int end) {
Set<Character> set = new HashSet<>();
for (int i = start; i < end; i++) {
Character ch = s.charAt(i);
if (set.contains(ch)) {
return false;
}
set.add(ch);
}
return true;
}
找出一个字符串中最长不重复子串的长度
最新推荐文章于 2024-06-29 23:00:55 发布