1332. Remove Palindromic Subsequences

Source: 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’

思路：因为只有a和b，可以先把所有a组成的子序列去掉，再去掉所有b组成的子序列。不过如果整个串就是回文，只需要1次。

class Solution {
public:
    bool ispalind(string s){
        int lens=s.length();
        for(int i=0;i<lens/2;i++){
            if(s[i]!=s[lens-1-i]){
                return false;
            }
        }
        return true;
    }
    int removePalindromeSub(string s) {
        int lens=s.length();
        if(lens==0){
            return 0;
        }
        if(ispalind(s)){
            return 1;
        }
        return 2;
    }
};