1337. Remove Palindromic Subsequences*
https://leetcode.com/problems/remove-palindromic-subsequences/
题目描述
Given a string s
consisting only of letters 'a'
and 'b'
. In a single step you can remove one palindromic subsequence from s
.
Return the minimum number of steps to make the given string empty.
A string is a subsequence of a given string, if it is generated by deleting some characters of a given string without changing its order.
A string is called palindrome if is one that reads the same backward as well as forward.
Example 1:
Input: s = "ababa"
Output: 1
Explanation: String is already palindrome
Example 2:
Input: s = "abb"
Output: 2
Explanation: "abb" -> "bb" -> "".
Remove palindromic subsequence "a" then "bb".
Example 3:
Input: s = "baabb"
Output: 2
Explanation: "baabb" -> "b" -> "".
Remove palindromic subsequence "baab" then "b".
Example 4:
Input: s = ""
Output: 0
Constraints:
0 <= s.length <= 1000
s
only consists of letters'a'
and'b'
C++ 实现 1
这道题… 需要抖抖机灵. 注意 subsequence 和 subarray 的区别, 前者不需要连续.
参考:
class Solution {
private:
bool isPalindrome(string s) {
int l = 0, r = s.size() - 1;
while (l < r) {
if (s[l] != s[r]) return false;
l ++;
r --;
}
return true;
}
public:
int removePalindromeSub(string s) {
if (s.empty()) return 0;
// 如果不是回文串, 那么可以先删除所有的 a, 然后再删除所有的 b ...
// 这样只需要两步...
if (isPalindrome(s)) return 1;
else return 2;
}
};