时间:2020-6-12
题目地址:https://leetcode-cn.com/problems/implement-queue-using-stacks/
题目难度:Easy
题目描述:
使用栈实现队列的下列操作:
push(x) -- 将一个元素放入队列的尾部。
pop() -- 从队列首部移除元素。
peek() -- 返回队列首部的元素。
empty() -- 返回队列是否为空。
示例:
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // 返回 1
queue.pop(); // 返回 1
queue.empty(); // 返回 false
说明:
你只能使用标准的栈操作 -- 也就是只有 push to top, peek/pop from top, size, 和 is empty 操作是合法的。
你所使用的语言也许不支持栈。你可以使用 list 或者 deque(双端队列)来模拟一个栈,只要是标准的栈操作即可。
假设所有操作都是有效的 (例如,一个空的队列不会调用 pop 或者 peek 操作)。
思路1:使用一个列表,这应该是不符合题意吧
代码段1:通过
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.li = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.li.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
temp = self.li[0]
del self.li[0]
return temp
def peek(self) -> int:
"""
Get the front element.
"""
return self.li[0]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
return len(self.li) == 0
# 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()
总结:
- 还是得认真审题,果然头晕晕的不适合写代码
思路2:使用两个栈,入队O(n),出队O(1)
peek()和pop()都是操作的最先进入队列的数
代码段2:通过
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.stack = []
self.help_stack = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
while self.stack:
self.help_stack.append(self.stack.pop())
self.help_stack.append(x)
while self.help_stack:
self.stack.append(self.help_stack.pop())
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
return self.stack.pop()
def peek(self) -> int:
"""
Get the front element.
"""
return self.stack[-1]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
return not bool(self.stack)
# 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()
总结:
- li[-1] 、bool()函数感觉自己基础没打好,明天开始刷leetcode数据结构卡片
思路3:使用两个栈,入队O(1),出队摊还复杂度O(1)
代码段3:通过
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.in_stack = []
self.out_stack = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.in_stack.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
if not self.out_stack:
while self.in_stack:
self.out_stack.append(self.in_stack.pop())
return self.out_stack.pop()
def peek(self) -> int:
"""
Get the front element.
"""
if not self.out_stack:
while self.in_stack:
self.out_stack.append(self.in_stack.pop())
return self.out_stack[-1]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
return not bool(self.out_stack) and not bool(self.in_stack)
# 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()
总结:
- 摊换分析
出队 操作最多可以执行的次数跟它之前执行过 入队 操作的次数有关。虽然一次 出队 操作代价可能很大,但是每 n 次 入队 才能产生这么一次代价为 n 的 出队 操作。因此所有操作的总时间复杂度为:n(所有的入队操作产生) + 2 * n(第一次出队操作产生) + n - 1(剩下的出队操作产生), 所以实际时间复杂度为 O(2*n)O(2∗n)。于是我们可以得到每次操作的平均时间复杂度为 O(2n/2n)O(2n/2n)=O(1)。