字符串 --- 3.5 Longest Palindromic Substring --- 图解

/**********************************************************************************************************
Given a string S, find the longest palindromic substring in S. You may assume that the maximum
length of S is 1000, and there exists one unique longest palindromic substring

**********************************************************************************************************/

class Solution{
public:
    string longestPalindrome(string s){
        const int n = s.size();
        boot f[n][n];
        fill_n(&f[0][0], n *n ,false);
        size_t max_len = 1, start = 0;
        for(size_t i = 0; i < s.size(); i++){
            f[i][i] = true;
            for(int j = 0;j < i;j++){
                f[j][i] = (s[j] == s[i] &&(i - j < 2 || f[j + 1][i - 1]));
                if(f[j][i] && max_len < (i - j + 1)){
                    max_len = i - j + 1;
                    start = j;
                }
            }
        }
        return s.substr(start , max_len);
    }
};

动态规划在遍历或者递归的过程中，出现子问题重复计算，记录其状态，在子问题上做更新，避免重复计算

加快了效率

 

参考资料：

LeetCode题解