import java.util.Stack;
public class MinStack {
/**
* @param args
*/
private static Stack<Integer> stack=new Stack<Integer>();
private static Stack<Integer> help=new Stack<Integer>();
//进栈
public void push(int arr[]){
for(int i : arr){
stack.push(i);
if(help.empty()){
help.push(i);
}else{
int m=help.peek();
if(i<m)
help.push(i);
}
}
}
//删除栈顶元素
public void pop(Stack<Integer> stack,Stack<Integer> help){
int m=stack.pop();
if(m<help.peek())
help.pop();
System.out.println(m);//为了测试下删除的元素
}
public static void main(String[] args) {
// TODO Auto-generated method stub
MinStack ms=new MinStack();
int arr[]={2,6,4,1,5};
ms.push(arr);
System.out.println(help.peek());
ms.pop(stack, help);
System.out.println(help.peek());
}
}
public class MinStack {
/**
* @param args
*/
private static Stack<Integer> stack=new Stack<Integer>();
private static Stack<Integer> help=new Stack<Integer>();
//进栈
public void push(int arr[]){
for(int i : arr){
stack.push(i);
if(help.empty()){
help.push(i);
}else{
int m=help.peek();
if(i<m)
help.push(i);
}
}
}
//删除栈顶元素
public void pop(Stack<Integer> stack,Stack<Integer> help){
int m=stack.pop();
if(m<help.peek())
help.pop();
System.out.println(m);//为了测试下删除的元素
}
public static void main(String[] args) {
// TODO Auto-generated method stub
MinStack ms=new MinStack();
int arr[]={2,6,4,1,5};
ms.push(arr);
System.out.println(help.peek());
ms.pop(stack, help);
System.out.println(help.peek());
}
}