- 【栈】
Valid Parentheses(有效的括号)
英文版:https://leetcode.com/problems/valid-parentheses/
中文版:https://leetcode-cn.com/problems/valid-parentheses/
class Solution:
def isValid(self, s: str) -> bool:
if s=="":
return True
dic={'(':')','[':']','{':'}'}#建立一个字典
stack=[]#建立一个栈
for i in s:#遍历字符串,如果为左括号,则加入栈
if i in dic:
stack.append(i)
continue
if stack and i ==dic[stack[-1]]:遇到右括号就与栈顶对应的右括号匹配,如果相等则删除栈顶元素
stack.pop()
else:
return False
if stack:
return False
else:
return True
Evaluate Reverse Polish Notatio(逆波兰表达式求值)
英文版:https://leetcode.com/problems/evaluate-reverse-polish-notation/
中文版: