Day11| 20. 有效的括号, 1047. 删除字符串中的所有相邻重复项, 150. 逆波兰表达式求值
20. 有效的括号
思路
创建一个list作为栈,保证如果当’(‘入栈时,下一个为’)‘才能出栈,这样每个左括号都能够按顺序匹配右括号。’
class Solution:
def isValid(self, s: str) -> bool:
record = []
for i in range(len(s)):
if s[i] == '(' or s[i] == '[' or s[i] == '{':
record.append(s[i])
elif s[i] == ')' and record[-1] == '(':
record.pop()
elif s[i] == ']' and record[-1] == '[':
record.pop()
elif s[i] == '}' and record[-1] == '{':
record.pop()
else:
return False
if len(record) != 0:
return False
return True
问题: 如果一开始就是右括号,则该代码 out of range
根据代码随想录的答案,入栈的时候直接放入右括号,在判断是否和下一个相等
class Solution:
def isValid(self, s: str) -> bool:
record = []
for item in s:
if item == '(':
record.append(')')
elif item == '[':
record.append(']')
elif item == '{':
record.append('}')
elif not record or record[-1] != item:
return False
else:
record.pop()
return True if not record else False
1047. 删除字符串中的所有相邻重复项
思路
要删除相邻相同元素,跟上一题类似,也可以用栈来匹配并消除元素。
class Solution:
def removeDuplicates(self, s: str) -> str:
result = list()
for item in s:
if result and result[-1] == item:
result.pop()
else:
result.append(item)
return "".join(result)
150. 逆波兰表达式求值
思路
逆波兰表达式:是一种后缀表达式,所谓后缀就是指运算符写在后面。
该题与上一题相似,利用栈来匹配,再做相应的运算
from operator import add, sub, mul
class Solution:
op_map = {'+': add, '-': sub, '*': mul, '/': lambda x, y: int(x / y)}
def evalRPN(self, tokens: List[str]) -> int:
stack = []
for token in tokens:
if token not in {'+', '-', '*', '/'}:
stack.append(int(token))
else:
op2 = stack.pop()
op1 = stack.pop()
stack.append(self.op_map[token](op1, op2))
return stack.pop()