题解 | #最长回文子串#

记录

import java.util.*;

public class Solution {
    public int getLongestPalindrome(String A, int n) {
        // write code here

        int[][] dp = new int[n][n];
        int max_len = 0;
        for (int i = n - 1; i >= 0; i--){
            for (int j = i; j < n; j++){
                int len = j - i + 1;
                if (A.charAt(i) == A.charAt(j)){
                    dp[i][j] = len <= 2 ? 1 : dp[i + 1][j - 1];
                }
                if (dp[i][j] != 0){
                    max_len = Math.max(len,max_len);
                }
            }
        }
        return max_len;
    }
}