Leetcode 刷题记录 Day8
Stack, Queue 理论基础:
Stack(栈): 后进先出
Queue(队列): 先进先出
232. Implementation Queue using Stacks
class MyQueue:
def __init__(self):
self.stack_in = []
self.stack_out = []
def push(self, x: int) -> None:
self.stack_in.append(x)
def pop(self) -> int:
if self.empty():
return None
if len(self.stack_out) != 0:
return self.stack_out.pop()
while len(self.stack_in) != 0:
self.stack_out.append(self.stack_in.pop())
return self.stack_out.pop()
def peek(self) -> int:
temp = self.pop()
self.stack_out.append(temp)
return temp
def empty(self) -> bool:
return not(self.stack_in or self.stack_out)
# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()
225. Implement Stack using Queues
from collections import deque
# 这里使用双向队列,我们保证只执行popleft()和append(),因为deque可以用索引访问,可以实现和peek相似的功能
class MyStack:
def __init__(self):
self.queue_in = deque()
self.queue_out = deque()
def push(self, x: int) -> None:
self.queue_in.append(x)
def pop(self) -> int:
if self.empty():
return None
for _ in range(len(self.queue_in) - 1):
self.queue_out.append(self.queue_in.popleft())
res = self.queue_in.popleft()
self.queue_in = self.queue_out
self.queue_out = deque()
return res
def top(self) -> int:
if self.empty():
return None
res = self.pop()
self.push(res)
return res
def empty(self) -> bool:
return len(self.queue_in) == 0
# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()
20. Valid Parentheses
遍历string, 如果是'(', '[', '{'其中一个, 在stack添加相反的括号, 遍历后续反括号进行消除, 如果stack内找不到或者不相等, 则不valid
class Solution:
def isValid(self, s: str) -> bool:
stack = []
for e in s:
if e == '(':
stack.append(')')
elif e == '[':
stack.append(']')
elif e == '{':
stack.append('}')
elif len(stack) == 0 or stack[-1] != e:
return False
else:
stack.pop()
return len(stack) == 0
1047. Remove All Duplicates In String
和上一题逻辑相似, 适合stack解决这种消除操作
class Solution:
def removeDuplicates(self, s: str) -> str:
stack = []
for e in s:
if len(stack) != 0 and stack[-1] == e:
stack.pop()
else:
stack.append(e)
return ''.join(stack)
150. Evaluate Reverse Polish Notation
什么是Reverse Polish Notation? 想想一个Binary Tree从下到上左到右进行运算
(1 + 2) * (3 + 4) =====> ['1', '2', '+', '3', '4', '+', '*']
使用栈stack进行操作:
遍历Polish Notation, 遇到操作符, 找前两个元素进行运算后append回stack进行下一步运算
class Solution:
def evalRPN(self, tokens: List[str]) -> int:
stack =[]
for t in tokens:
if t in['+', '-', '*', '/']:
a = stack.pop()
b = stack.pop()
if t == '+':
tmp = a + b
elif t == '-':
tmp = b - a
elif t == '*':
tmp = a * b
else:
tmp = int(b / a)
stack.append(tmp)
else:
stack.append(int(t))
return stack[-1]