leetcode 232 Implement Queue using Stacks
2015-09-01 22:42
323 查看
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.
Notes:
You must use only standard operations of a stack -- which means only
and
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) -- 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.
Notes:
You must use only standard operations of a stack -- which means only
push to top,
peek/pop from top,
size,
and
is emptyoperations 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).
class MyQueue { private List<Integer> stack = new ArrayList<Integer>(); private List<Integer> tmp = new ArrayList<Integer>(); public void push(int x) { stack.add(x); } public void pop() { int len = stack.size(); tmp.clear(); for (int i = len-1; i >= 0; i--) { tmp.add(stack.get(i)); } stack.clear(); for (int i = tmp.size()-2; i >= 0; i--) { stack.add(tmp.get(i)); } } public int peek() { int len = stack.size(), ans = -1; for (int i = len-1; i>=0; i--) { ans = stack.get(i); } return ans; } public boolean empty() { return stack.size() == 0; } } public class Solution232 { public static void main(String[] args) { MyQueue myQueue = new MyQueue(); myQueue.push(1); myQueue.push(2); System.out.println(myQueue.peek()); myQueue.pop(); myQueue.pop(); System.out.println(myQueue.empty()); } }
相关文章推荐
- 部署Mirantis OpenStack与Fuel的系统配置要求说明
- iOS 在UILabel显示不同的字体和颜色
- 图片拉伸通常我们开发中将其写到UIImage的分类中使用,下面可以直接复制使用
- UIday0703:用 UIScrollView 和 UIPageControl 实现轮播图
- UI多线程编程小练习--卖票系统
- UIday0702:用 UIScrollView 和 UIPageControl 实现引导图
- hdu 2818 Building Block (带权并查集,很优美的题目)
- 将UIView加载成WevView(不懂的可以留言)
- UI中常用的4种传值
- Win10开发:视觉状态VisualState与自适应UI
- UITabBar 自定义
- AbstractQueuedSynchronizer实现原理
- UVALive 4287 Proving Equivalence (强连通分量)
- Android UI设计(引导界面):ViewPager之基本用法
- java基础-GUI
- [DP!]UESTC 890
- LeetCode之Repeated DNA Sequences
- UI_UIGestureRecognizer(触摸手势)
- UINavigationController视图控制器
- iPhone第三节:UITableView(2)