LeetCode每日一刀---

中心扩展的方式去寻找，

class Solution {
    public String longestPalindrome(String s) {
        if (s == null || s.length() == 0)return "";
        int left = 0 ;
        int right = 0 ;
        String str = s.charAt(0)+"";
        for(int index = 0 ; index < s.length()-1 ; index ++){
            left = index -1 ;
            right = index + 1;
            while(s.charAt(index) == s.charAt(right)){
                str = str.length() > s.substring(index,right+1).length() ? str : s.substring(index,right+1);
                right++ ;
                if (right == s.length() || s.charAt(index) != s.charAt(right))break;
            }
            while(right < s.length() && left >= 0 && s.charAt(left) == s.charAt(right)){
                str = str.length() > s.substring(left,right+1).length() ? str : s.substring(left,right+1);
                left-- ;
                right++ ;
            }
        }
        return str;
    }
}