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