【代码随想录】Day 10 232.用栈实现队列 225.用队列实现栈
栈队列基础知识
队列先进先出
栈先进后出
232.用栈实现队列
需要用两个栈,一个进一个出
删除元素的时候,输出栈如果是空的,就从输入栈把元素全部都导入进来,如果输出栈不为空,就直接从输出栈弹出数据
如果进栈出栈都是空的,那么模拟的队列是空的
注意 not self.stack_out 和self.stack_out==None是不一样的
class MyQueue(object):
def __init__(self):
self.stack_in=[]
self.stack_out=[]
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.stack_in.append(x)
def pop(self):
"""
:rtype: int
"""
if self.empty():
return None
if not self.stack_out :
for i in range(len(self.stack_in)):
self.stack_out.append(self.stack_in.pop())
return(self.stack_out.pop())
else:
return(self.stack_out.pop())
def peek(self):
"""
:rtype: int
"""
ans = self.pop()
self.stack_out.append(ans)
return ans
def empty(self):
"""
:rtype: 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.用队列实现栈
用两个队列实现栈
append 将元素添加在最右侧
popleft删除最左侧元素
注意:return len(self.queue_in)0 和 return self.queue_in0是不一样的,可能元素由空列表组成。
class MyStack(object):
def __init__(self):
self.queue_in = deque()
self.queue_out = deque()
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.queue_in.append(x)
def pop(self):
"""
:rtype: int
"""
if self.empty():
return None
for i in range(len(self.queue_in)-1):
self.queue_out.append(self.queue_in.popleft())
self.queue_out,self.queue_in = self.queue_in,self.queue_out
return self.queue_out.popleft()
def top(self):
"""
:rtype: int
"""
ans = self.pop()
self.queue_in.append(ans)
return ans
def empty(self):
"""
:rtype: 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()
用一个队列模拟栈
将队列头部的元素除了最后一个元素重新添加到队尾
在这里插入代码片