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”
找到最长的回文字符串,看一下一个比较好的解法(动态规划问题),我是看到了这篇讲解的挺好的博客
- table[i][j]代表字符串i位置到j位置,值为true则为回文字符串,反之则不是
- 若table[i][j]是回文字符串(值为true),那么table[i+1][j-1]也一定为true
假设有个字符串是adade,现在要找到其中的最长回文子串。使用上面的关系,有如下的过程:
按照红箭头->黄箭头->蓝箭头->绿箭头->橙箭头的顺序依次填入矩阵,通过这个矩阵记录从i到j是否是一个回文串。
代码如下:
public String longestPalindrome(String s) {
char[] chars = s.toCharArray();
int len = chars.length;
if(len < 2) {
return s;
}
int[][]dp = new int[len][len];
for(int i=0; i<len; i++) {
dp[i][i] = 1;
}
int max = 1;
int start = 0;
for(int j=1; j<chars.length; j++) {
for(int i=0; i<j; i++) {
if(chars[i] != chars[j]) {
dp[i][j] = 0;
} else {
if(j-i<3) {
dp[i][j] = 1;
} else {
dp[i][j] = dp[i + 1][j - 1];
}
}
if(dp[i][j]>0 && j-i+1>max) {
max = j-i+1;
start = i;
}
}
}
return s.substring(start, start+max);
}
下边为待优化老代码
public String longestPalindrome(String s) {
int n = s.length();
int longestBegin = 0;
int maxLen = 1;
boolean [][]table = new boolean[1000][1000];
for (int i = 0; i < n; i++) {
table[i][i] = true;
}
for (int i = 0; i < n-1; i++) {
if (s.charAt(i) == s.charAt(i+1)) {
table[i][i+1] = true;
longestBegin = i;
maxLen = 2;
}
}
for (int len = 3; len <= n; len++) {
for (int i = 0; i < n-len+1; i++) {
int j = i+len-1;
if (s.charAt(i) == s.charAt(j) && table[i+1][j-1]) {
table[i][j] = true;
longestBegin = i;
maxLen = len;
}
}
}
return s.substring(longestBegin, longestBegin+maxLen);
}