最长回文子串

babad最长回文子串为bab或者aba

暴力法

public String longestPalindrome(String s) {
        int len = s.length();
        if (s.length() < 2) {
            return s;
        }
        String maxS = s.substring(0, 1);
        int maxL = 1;
        for (int i = 0; i < len - 1; i++) {
            for (int j = i + 1; j < len; j++) {
            //将长度判定放在前面，可以降低时间
                if (j - i + 1 > maxL && isPalindrome(s, i, j)) { 
                    maxS = s.substring(i, j + 1);
                    maxL = j - i + 1;
                }
            }
        }
        return maxS;
    }

    public boolean isPalindrome(String s, int left, int right) {
        while (left < right) {
            if (s.charAt(left) != s.charAt(right)) {
                return false;
            }
            left++;
            right--;
        }
        return true;
    }