class Solution {
public String longestPalindrome(String s){if(s==null||s.length()==0){return"";}// 首先是这里 ""// if(s.length()==1) return s;int slen = s.length();//再者 string的 length()和数组的 length不一样int left =0;int right =0;int len =1;// 这里两个 lenint maxStart =0;int maxLen =0;//这里两个 len 搞清楚了for(int i =0; i < slen; i++){
left = i -1;
right = i +1;while(left >=0&& s.charAt(left)== s.charAt(i)){
len++;//??????????????
left--;}while(right < slen && s.charAt(right)== s.charAt(i)){
len++;
right++;}while(left >=0&& right <slen && s.charAt(left)==s.charAt(right)){
len = len +2;
left = left -1;
right = right +1;}if(len >maxLen){//这个判断条件是在 for循环之内的 每一次maxLen都要跟新
maxLen = len ;
maxStart = left ;}
len =1;//如果上述都不成立,}return s.substring(maxStart +1,maxStart + maxLen +1);}}