题解 | #NC17 最长回文子串--暴力求解#

import java.util.*;


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

    public static boolean isPalindrome(String s) {
        int l = s.length();
        for (int i = 0; i < l / 2; i++) {
            if (s.charAt(i) != s.charAt(l - i - 1)) {
                return false;
            }
        }
        return true;
    }
}