leetcode 5. Longest Palindromic Substring

Discription

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example:

Input: “babad”

Output: “bab”

Note: “aba” is also a valid answer.
Example:

Input: “cbbd”

Output: “bb”

思路

回文串题型基本都是动态规划。

设dp[i][j] 表示s[i:j]所构成字符串对应回文串长度，若不是则dp[i][j] = -1;
递归方程如下

$$dp[i][j] = \begin{cases} 0 & i > j \\ 1 & i = j \\ dp[i + 1][j - 1] + 2 & i < j \ 且 \ dp[i + 1][j - 1] >= 0 \end{cases}$$

时间复杂度：$O(n^2)$
空间复杂度：$O(n^2)$

代码

class Solution {
public:
    string longestPalindrome(string s) {
        vector<vector<int>> dp(s.size(), vector<int>(s.size(), 0)); //dp[i][j] 表示s[i:j]对应回文串长度

        for (int i = 0; i < s.size(); i++)
        {
            for (int j = 0; j < s.size(); j++)
            {
                if (i == j) dp[i][j] = 1;       // "a" 构成回文串
                if (i < j) dp[i][j] = -1;       
            }
        }

        int max_start = 0, max_len = 1;
        for (int len = 2; len <= s.size(); len++)
        {
            for (int start = 0; start + len - 1 < s.size(); start++)
            {
                int end = start + len - 1;
                if (s[start] == s[end])
                {
                    if (dp[start + 1][end - 1] >= 0)
                    {                                                   //case 1: "bb"
                        dp[start][end] = dp[start + 1][end - 1] + 2;    //case 2: "bab"
                        if (len > max_len)
                        {
                            max_len = len;
                            max_start = start;
                        }
                    }
                }
            }
        }
        return s.substr(max_start, max_len);
    }
};

特殊样例

“bb”
“bab”