【lc刷题】1544. Make The String Great

Given a string s of lower and upper case English letters.

A good string is a string which doesn’t have two adjacent characters
s[i] and s[i + 1] where:

0 <= i <= s.length - 2 s[i] is a lower-case letter and s[i + 1] is the
same letter but in upper-case or vice-versa. To make the string good,
you can choose two adjacent characters that make the string bad and
remove them. You can keep doing this until the string becomes good.

Return the string after making it good. The answer is guaranteed to be
unique under the given constraints.

Notice that an empty string is also good.
Example 1:

Input: s = “leEeetcode” Output: “leetcode” Explanation: In the first
step, either you choose i = 1 or i = 2, both will result “leEeetcode”
to be reduced to “leetcode”. Example 2:

Input: s = “abBAcC” Output: “” Explanation: We have many possible
scenarios, and all lead to the same answer. For example: “abBAcC” -->
“aAcC” --> “cC” --> “” “abBAcC” --> “abBA” --> “aA” --> “” Example 3:

Input: s = “s” Output: “s”

Constraints:

1 <= s.length <= 100 s contains only lower and upper case English
letters.
来源

简单题，类似于20. valid parentheses

思路：stack
先扔一个进去，然后后面遍历，打头儿的跟stack的尾巴比，看看是不是aA或者Aa这种模式（这里可用ascii，大写跟小写差着32个数），如果是的话，就把尾巴删了，如果不是就把打头儿的加进去（变成尾巴）。

class Solution:

    def makeGood(self, s: str) -> str:
        stack = [s[0]] 
        for i in range(1, len(s)):
            if stack and abs(ord(s[i])- ord(stack[-1])) == 32:
                stack.pop() 
            else:
                stack.append(s[i])
                
        return ''.join(stack)