代码随想录Day11|栈与队列2

20.有效的括号

• 简单的栈匹配，注意条件不要混乱

class Solution:
    def isValid(self, s: str) -> bool:
        stack = []
        for i in s:
            if i in ["[",'(',"{"]:
                stack.append(i)
            elif stack :
                temp =  stack.pop()
                if (i == ']' and temp=='[') or (i == ')' and temp=='(') or (i == '}' and temp=='{'):
                    continue
                else:
                    return False
            else:
                return False
        return False if stack else True

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

• 要想到用栈的思想

class Solution:
    def removeDuplicates(self, s: str) -> str:
        stack = []
        for i in s:
            if stack and stack[-1]==i:
                stack.pop()
            else:
                stack.append(i)
        return ''.join(stack)

150.逆波兰表达式

• 相对于前一题，知道是比较常规知道的栈运算

class Solution:
    def evalRPN(self, tokens: List[str]) -> int:
        op_map = {"+":add,'-':sub,'*':mul,"/":lambda x,y:int(x/y)}
        stack = []
        for i in tokens:
            if i not in op_map:
                stack.append(int(i))
            else:
                op1 = stack.pop()
                op2 = stack.pop()
                stack.append(op_map[i](op2,op1))
        return stack[-1]