采用动态规划算法,beat 90.53%
public class Solution {
public int lengthOfLongestSubstring(String s) {
if(s.length()==0)
return 0;
if(s.length()==1)
return 1;
int maxLen=1;
int[] b=new int[s.length()];
b[0]=1;
for(int i=1;i<s.length();i++){
char curChar=s.charAt(i);
b[i]=1;
for(int j=i-1,count=1;count<=b[i-1];count++,j--){
char desChar=s.charAt(j);
if(curChar!=desChar)
b[i]++;
else
break;
}
if(b[i]>maxLen)
maxLen=b[i];
}
return maxLen;
}
}