题目链接:https://leetcode.com/problems/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.
给定一个字符串s,求s中最长的回文子字符串。
很明显这道题使用动态规划的方法实现起来会比较简单,通过建立一个bool矩阵p,p[i][j]表示s[i]到s[j]的子串是否为回文子串。并且有:
初始化:p[i][i] = true; p[i][i+1] = (s[i] == s[i+1]);
规划:若i-j<2,即i和j是同字符或连续的字符,则p[j][i] = (s[i] == s[j]);否则,p[j][i] = (p[j+1][i-1] && s[j] == s[i]);
在规划中,记录长度最长的子字符串长度和开始位置,最后作为返回值。
代码如下:
class Solution {
public:
string longestPalindrome(string s) {
int n = s.length();
bool **p = new bool*[n];
for (int i = 0; i < n; i++) {
p[i] = new bool[n];
for (int j = 0; j < n; j++) p[i][j] = false;
p[i][i] = true;
if (i < n - 1 && s[i] == s[i + 1]) p[i][i + 1] = true;
}
int max_len = 1;
int start = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (i - j < 2) p[j][i] = (s[i] == s[j]);
else p[j][i] = (s[i] == s[j] && p[j + 1][i - 1]);
if (p[j][i] && (i - j + 1) > max_len) {
max_len = i - j + 1;
start = j;
}
}
}
return s.substr(start, max_len);
}
};