无重复字符的最长子串 https://leetcode-cn.com/explore/interview/card/bytedance/242/string/1012/
输入: "abcabcbb" 输出: 3 解释: 因为无重复字符的最长子串是
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Solution s = new Solution();
int a = s.lengthOfLongestSubstring("aab");
System.out.println(a);
}
}
class Solution {
public int lengthOfLongestSubstring(String s) {
char[] arr = s.toCharArray();
int result = 0;
int point = 0;
int jump = -1;
int start = 0;
for(int i=1; i<arr.length; i++){
for(int j=start; j<i; j++){
if(arr[i] == arr[j]){
result = i - start>result?i - start:result;
i = j+1;
start = j+1;
break;
}
}
if(i==arr.length-1){
result = i - start+1>result?i - start+1:result;
}
}
return result==0?arr.length:result;
}
}
"abc",所以其
长度为 3。
思路:双重循环比较,切记for循环中i++结束循环后+1