232. Implement Queue using Stacks
来源:互联网 发布:域名抵押贷款骗局 编辑:程序博客网 时间:2024/06/03 18:10
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.
- You must use only standard operations of a stack -- which means only
push to top
,peek/pop from top
,size
, andis 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).
public class MyQueue { Stack<Integer> stack = new Stack<Integer>(); /** Initialize your data structure here. */ public MyQueue() { } /** Push element x to the back of queue. */ public void push(int x) { Stack<Integer> temp = new Stack<Integer>(); while (!stack.isEmpty()) { temp.push(stack.pop()); } temp.push(x); while (!temp.isEmpty()) { stack.push(temp.pop()); } } /** Removes the element from in front of queue and returns that element. */ public int pop() { return stack.pop(); } /** Get the front element. */ public int peek() { return stack.peek(); } /** Returns whether the queue is empty. */ public boolean empty() { return stack.isEmpty(); }}/** * Your MyQueue object will be instantiated and called as such: * MyQueue obj = new MyQueue(); * obj.push(x); * int param_2 = obj.pop(); * int param_3 = obj.peek(); * boolean param_4 = obj.empty(); */
0 0
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- 232. Implement Queue using Stacks
- Android 笔记 canvas.save()
- [Leetcode] 9. Palindrome Number
- 计算当前日期是今年第几周的JS代码封装
- 1.26.4
- [LeetCode]303. Range Sum Query - Immutable
- 232. Implement Queue using Stacks
- 9.标题:买不到的数目
- [Leetcode] 11. Container With Most Water
- Android内存溢出与优化(三)——使用完后要close、recycle、unregister、null
- 1.26.5
- 53. Maximum Subarray \ 35. Search Insert Position
- 基于GD32写的串口应用程序
- java环境配置
- Linux编译PPSSPP模拟器