【字符串-简单】1544. 整理字符串

【题目】
给你一个由大小写英文字母组成的字符串 s 。
一个整理好的字符串中，两个相邻字符 s[i] 和 s[i+1]，其中 0<= i <= s.length-2 ，要满足如下条件:
若 s[i] 是小写字符，则 s[i+1] 不可以是相同的大写字符。
若 s[i] 是大写字符，则 s[i+1] 不可以是相同的小写字符。
请你将字符串整理好，每次你都可以从字符串中选出满足上述条件的 两个相邻 字符并删除，直到字符串整理好为止。
请返回整理好的 字符串 。题目保证在给出的约束条件下，测试样例对应的答案是唯一的。
注意：空字符串也属于整理好的字符串，尽管其中没有任何字符。
【示例 1】
输入：s = “leEeetcode”
输出：“leetcode”
解释：无论你第一次选的是 i = 1 还是 i = 2，都会使 “leEeetcode” 缩减为 “leetcode” 。
【示例 2】
输入：s = “abBAcC”
输出：""
解释：存在多种不同情况，但所有的情况都会导致相同的结果。例如：
“abBAcC” --> “aAcC” --> “cC” --> “”
“abBAcC” --> “abBA” --> “aA” --> “”
【示例 3】
输入：s = “s”
输出：“s”
【提示】
1 <= s.length <= 100
s 只包含小写和大写英文字母
【代码】

class Solution {
public:
    string makeGood(string s) {
        stack<char> s_stack;
        char topchar;
        string rs="";
        string helper[]={"a","b","c","d","e","f","g","h","i","j",
        "k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"};
        string helperdaxie[]={"A","B","C","D","E","F","G","H","I","J",
        "K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"};
        for(auto x:s)
            if(s_stack.empty()){
                s_stack.push(x);
            }else{
                topchar=s_stack.top();
                if((topchar>='A'&&topchar<='Z'&&x>='a'&&x<='z'&&(x-topchar)==32)
                ||(isupper(topchar)==0&&isupper(x)&&(topchar-x)==32)){//如果是大写字母
                    s_stack.pop();
                }else{
                    topchar=s_stack.top();
                    s_stack.push(x);
                }
            }
        while(!s_stack.empty()){
            if(isupper(s_stack.top()))
                rs+=helperdaxie[s_stack.top()-'A'];
            else
                rs+=helper[s_stack.top()-'a'];

            s_stack.pop();
        }
        reverse(rs.begin(),rs.end());
        return rs;
    }
};

【值得学习】

class Solution {
public:
    string makeGood(string s) {
        string ret;
        for (char ch: s) {
            if (!ret.empty() && tolower(ret.back()) == tolower(ch) && ret.back() != ch) {
                ret.pop_back();
            }
            else {
                ret.push_back(ch);
            }
        }
        return ret;
    }
};