【leetcode刷刷】20. 有效的括号、1047. 删除字符串中的所有相邻重复项、150. 逆波兰表达式求值

20. 有效的括号

1. 栈简单的应用

class Solution:
    def isValid(self, s: str) -> bool:
        stack = []
        # 使用字典
        mapping = {'(':')', '[':']', '{':'}'}
        for i in s:
            if i in mapping.keys():
                stack.append(mapping[i])
            elif not stack or stack[-1]!=i:
                return False
            else:
                stack.pop()
        return True if not stack else False

        # 使用一堆if else
        for i in s:
            if i in ['(', '[', '{']:
                stack.append(i)
            elif i in [')', ']', '}']:
                if stack == []:
                    return False
                tmp = stack.pop()
                if i == ')' and tmp == '(':
                    continue
                elif i == ']' and tmp == '[':
                    continue
                elif i == '}' and tmp == '{':
                    continue
                else:
                    return False
        if stack:
            return False
        else:
            return True

1047. 删除字符串中的所有相邻重复项

1. 也可以用双指针模拟栈，但今天时间不多就没有写

class Solution:
    def removeDuplicates(self, s: str) -> str:
        stack = []
        for i in s:

            if not stack or stack[-1] != i:
                stack.append(i)
            else:
                stack.pop()
        return "".join(stack)

150. 逆波兰表达式求值

1. 后缀表达式的优点：不用括号；可以用栈
2. 用map可以减少if else的判断
3. 要注意pop1和pop2在进行运算时的先后

class Solution:
    op_map = {'+': add, '-': sub, '*': mul, '/': lambda x, y: int(x / y)}

    def evalRPN(self, tokens: List[str]) -> int:
        stack = []
        
        for i in tokens:
            if i in ['+', '-', '*', '/']:
                pop1 = stack.pop()
                pop2 = stack.pop()   
                stack.append(self.op_map[i](pop2, pop1))
                # if i == '+': stack.append(pop2 + pop1)
                # elif i == '-':stack.append(pop2 - pop1)
                # elif i == '*':stack.append(pop2 * pop1)
                # elif i == '/':stack.append(int(pop2 / pop1))
            else:
                stack.append(int(i))
        return stack.pop()