225. 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:
Notes:
You must use only standard operations of a queue -- which means only
push to back
,peek/pop from front
,size
, andis 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).
解题要点:
用两个queue,当需要加进一个新元素,先加到q2,放到其头部,然后把q1的元素全部倾倒过来。随后再把q2里的元素倾倒在q1里,这样我们就有了能提取数据就像stack一样的q1。
Last updated
Was this helpful?