题解 | 最长回文子串

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param A string字符串 
     * @return int整型
     */
    public int getLongestPalindrome (String A) {
        // write code here
        int n = A.length();
        boolean[][] dp = new boolean[n][n];
        int max = 1;
        for (int right=1; right<n; right++) {
            for (int left = 0; left < right; left++) {
                if (A.charAt(right) == A.charAt(left) && (dp[left+1][right-1] || right - left <= 2)) {
                    dp[left][right] = true;
                    if (right - left + 1 > max) {
                        max = right - left + 1;
                    }
                } 
            }
        }
        return max;
        

    }
}