mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 16:36:41 +08:00
39 lines
1.1 KiB
Markdown
39 lines
1.1 KiB
Markdown
# [232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)
|
||
|
||
## 题目
|
||
|
||
Implement the following operations of a queue using stacks.
|
||
|
||
- push(x) -- Push element x to the back of queue.
|
||
- pop() -- Removes the element from in front of queue.
|
||
- peek() -- Get the front element.
|
||
- empty() -- Return whether the queue is empty.
|
||
|
||
Example :
|
||
|
||
```c
|
||
MyQueue queue = new MyQueue();
|
||
|
||
queue.push(1);
|
||
queue.push(2);
|
||
queue.peek(); // returns 1
|
||
queue.pop(); // returns 1
|
||
queue.empty(); // returns false
|
||
```
|
||
|
||
Note:
|
||
|
||
- You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
|
||
- Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
|
||
- You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
|
||
|
||
|
||
## 题目大意
|
||
|
||
题目要求用栈实现一个队列的基本操作：push(x)、pop()、peek()、empty()。
|
||
|
||
## 解题思路
|
||
|
||
按照题目要求实现即可。
|
||
|