class Solution {
public int lengthOfLongestSubstring(String s) {
int l = 0;
for(int i = 0 ; i < s.length() ; i++){
int count = 1;
for (int j = i + 1 ; j < s.length() ; j++){
if ((s.substring(i,j).indexOf(s.charAt(j))) != (-1)){
break;
}
count++;
}
if(count > l){
l = count;
}
}
return l;
}
}
力扣Leetcode——3.无重复字符的最长子串(Java)
于 2022-02-27 15:38:44 首次发布