这题采用动态规划的思路来进行处理,代码如下,但是在oj 上提示内存泄漏,代码贴出来如下
#include"iostream"
#include"string";
using namespace std;
int max_length = 1;
int max_begin = 0;
class Solution {
public:
string longestPalindrome(string s) {
int length = s.length();
bool **flag = new bool *[length];
for (int i = 0; i < length; i++)
flag[i] = new bool[length];
for (int i = 0; i < length; i++)
for (int j = i; j < length; j++)
flag[i][j] = true;
for (int gap = 1; gap < length; gap++)
for (int j = 0; j + gap < length; j++)
{
if (flag[gap + j - 1][j + 1] == false || s[j] != s[gap + j])
flag[gap + j][j] = false;
else {
flag[gap + j][j] = true;
if (gap + 1 > max_length)
{
max_length = gap + 1;
max_begin = j;
}
}
}
string max_string(s, max_begin, max_length);
return max_string;
}
};