题解 | #最长回文子串#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param A string字符串
     * @return int整型
     */
    public int getLongestPalindrome (String A) {
        // write code here
        int max = 0;
        if (isHuiwenStr(A)) {
            max = A.length();
        } else {
            for (int i = 0; i < A.length(); i++) {
                for (int j = i + 1; j < A.length(); j++) {
                    String s = A.substring(i, j);
                    if (isHuiwenStr(s)) {
                        max = Math.max(j - i, max);
                    }
                }
            }
        }
        return max;
    }

    private static boolean isHuiwenStr(String s) {
        String ss = new StringBuilder(s).reverse().toString();
        return s.equals(ss);
    }
}