题解 | 最长回文子串

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param A string字符串 
     * @return int整型
     */
    int getLongestPalindrome(string A) {
        // write code here
        int n = A.size();
        int maxLen = 1;

        vector<vector<bool>> dp(n, vector<bool>(n, false));
        for(int i = 0; i < n; ++i){
            dp[i][i] = true;
        }
        for(int L = 2; L <= n; ++L){
            for(int i = 0; i < n; ++i){
                int j = i + L -1;
                if(j >= n) break;

                if(A[i] != A[j]) dp[i][j] = false;
                else{
                    if(j - i < 3){
                        dp[i][j] = true;
                    }
                    else{
                        dp[i][j] = dp[i + 1][j - 1];
                    }
                }
                if(dp[i][j] && j - i + 1 > maxLen){
                    maxLen = j - i + 1;
                }
            }
        }
        return maxLen;
    }
};