[leetcode] 1544. Make The String Great

Description

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.

分析

题目的意思是：给定一个字符串，如果同一字母的大小写相邻，则删除。求最终得到的字符串。这道题用栈实现，把暂时不能匹配的字符压入栈中，如果匹配就出栈。

代码

class Solution:
    def makeGood(self, s: str) -> str:
        s1=[]
        for ch in s:
            if(len(s1)==0):
                s1.append(ch)
            else:
                if(ord(s1[-1])+32==ord(ch) or ord(s1[-1])-32==ord(ch)):
                    s1.pop()
                else:
                    s1.append(ch)
        return ''.join(s1)  

参考文献

[LeetCode] Python beats 99.5 % and simple solution using stack