int countSubstrings(string s) {
int ret = 0;
for (int i = 0; i < s.size(); i++) {
ret += isPal(s, i, i);
ret += isPal(s, i, i+1);
}
return ret;
}
int isPal(string& s, int left, int right) {
int cnt = 0;
while (left >= 0 && right < s.size() && s[left] == s[right]) {
left--;
right++;
cnt++;
}
return cnt;
}
string longestPalindrome(string s) {
int start = 0, end = 0;
for (int i = 0; i < s.size(); i++) {
auto [left1, right1] = searchAroundCenter(s, i, i);
auto [left2, right2] = searchAroundCenter(s, i, i+1);
if (right1 - left1 > end - start) {
start = left1;
end = right1;
}
if (right2 - left2 > end - start) {
start = left2;
end = right2;
}
}
return s.substr(start, end - start + 1);
}
pair<int, int> searchAroundCenter(string &s, int left, int right) {
while(left >= 0 && right < s.size() && s[left] == s[right]) {
--left;
++right;
}
return {left + 1, right - 1};
}
链接:516. 最长回文子序列 - 力扣(LeetCode)
解题思路:
-
dp[i][j]表示字符串 s 的下标范围 [i,j]内的最长回文子序列的长度;
-
由于任何长度为 111 的子序列都是回文子序;
-
如果s[i]与s[j]相同,那么dp[i][j] = dp[i + 1][j - 1] + 2;
-
如果s[i]与s[j]不相同,加入s[j]的回文子序列长度为dp[i + 1][j],加入s[i]的回文子序列长度为dp[i][j - 1]。
int longestPalindromeSubseq(string s) {
vector<vector<int>> dp(s.size(), vector<int>(s.size(), 0));
for (int i = 0; i < s.size(); i++) dp[i][i] = 1;
for (int i = s.size() - 1; i >= 0; i--) {
for (int j = i+1; j < s.size(); j++) {
if (s[i] == s[j]) dp[i][j] = dp[i+1][j-1] + 2;
else dp[i][j] = max(dp[i+1][j], dp[i][j-1]);
}
}
return dp[0][s.size()-1];
}