首页 > 其他 > 详细

Min Stack

时间:2015-01-17 16:26:01      阅读:129      评论:0      收藏:0      [点我收藏+]

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

  • push(x) -- Push element x onto stack.
  • pop() -- Removes the element on top of the stack.
  • top() -- Get the top element.
  • getMin() -- Retrieve the minimum element in the stack.
 1 class MinStack {
 2     
 3     Stack<Integer>stack=new Stack<Integer>();
 4     
 5     Stack<Integer>min_stack=new Stack<Integer>();
 6     
 7     public void push(int x) {
 8         if(min_stack.isEmpty()||x<=min_stack.peek()){
 9             min_stack.push(x);
10         }
11         stack.push(x);
12     }
13 
14     public void pop() {
15         if(stack.peek().equals(min_stack.peek())){
16             min_stack.pop();
17         }
18         stack.pop();
19     }
20 
21     public int top() {
22         return stack.peek();
23     }
24 
25     public int getMin() {
26         return min_stack.peek();
27     }
28 }

 用一个min_stack来记录当前最小值,以空间换时间的思想。

Min Stack

原文:http://www.cnblogs.com/mrpod2g/p/4230514.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!