声明:本题及相关刷题笔记同步github之中,欢迎Fork & Star GitHub:https://github.com/HoqiheChen。如有不足之处,烦请改正。QQ Mail:851774342@qq.com
Description
Given a string s, find the longest palindromic substring in s.
Brief
求最长回文子串问题。
Input
(1)“babad”
(2)“cbbd”
Output
(1)“bab"或"aba”
(2)“bb”
Explanation
You may assume that the maximum length of s is 1000.
Ideas
二维动态规划问题。设
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]表示String中i到j是否为回文子串。
则可以得出如下状态转移方程:
当string.charAt(i)==string.charAt(j)时,
d
p
[
i
]
[
j
]
=
d
p
[
i
+
1
]
[
j
−
1
]
;
dp[i][j]=dp[i+1][j-1];
dp[i][j]=dp[i+1][j−1];
当不相等时,
d
p
[
i
]
[
j
]
=
f
a
l
s
e
dp[i][j]=false
dp[i][j]=false;
有两个特殊情况需要考虑:
当字符长度为1时,始终为true;
当字符长度为2时,只需要判断string.charAt(i)和string.charAt(j)是否相等即可。
Code
class Solution {
public String longestPalindrome(String s) {
if(s == null || s.length() == 0){
return "";
}
int length = s.length();
int maxLen = -1;
boolean[][] dp = new boolean[length][length];
String res = "";
for(int len = 1;len <= length;len ++){
for(int start = 0;start < length;start ++){
int end = start + len - 1;
if(end >= length){
break;
}
dp[start][end] = (s.charAt(start) == s.charAt(end)) && (len == 1 || len == 2 || dp[start + 1][end - 1]);
if(len > maxLen && dp[start][end]){
maxLen = len;
res = s.substring(start,start+len);
}
}
}
return res;
}
}
声明:本题及相关刷题笔记同步github之中,欢迎Fork & Star GitHub:https://github.com/HoqiheChen。如有不足之处,烦请改正。QQ Mail:851774342@qq.com