题目描述:
实现一个MyQueue类,该类用两个栈来实现一个队列。
示例:
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // 返回 1
queue.pop(); // 返回 1
queue.empty(); // 返回 false
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/implement-queue-using-stacks-lcci
解题思路及代码:
### 解题思路
使用两个栈模拟一个队列的效果。
1.使用栈1来对新加入的数字模拟入队列的操作;
2.使用栈2来保存栈1出栈的数字顺序,从而保证栈1的出栈数字是队列的出队数字。
### 代码
```python3
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.Stack1 = []
self.Stack2 = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.Stack1.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
if self.Stack2:
return self.Stack2.pop()
else:
while self.Stack1:
self.Stack2.append(self.Stack1.pop())
return self.Stack2.pop()
def peek(self) -> int:
"""
Get the front element.
"""
if self.Stack2:
return self.Stack2[-1]
else:
while self.Stack1:
self.Stack2.append(self.Stack1.pop())
return self.Stack2[-1]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
return len(self.Stack1) == 0 and len(self.Stack2) == 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()
```
提交结果: