* 设计实现一个有getMin功能的栈 (实现一个特殊的栈,在实现栈的基本功能(pop,push)的基础上, 再实现返回栈中最小元素(getMin)的操作)
import java.util.*;
/**
* 设计实现一个有getMin功能的栈
* (实现一个特殊的栈,在实现栈的基本功能(pop,push)的基础上,
* 再实现返回栈中最小元素(getMin)的操作)
* @author superman
*
*/
public class getMin {
private Stack <Integer> stackData;
private Stack <Integer> stackMin;
public getMin()
{
this.stackData=new Stack<Integer>();
this.stackMin=new Stack<Integer>();
}
//向栈中添加元素
public void push(int newNum)
{
//存储最小数据的栈
if(this.stackMin.isEmpty())
{
this.stackMin.push(newNum);
}
else if(newNum<=this.getMin())
{
this.stackMin.push(newNum);
}
//数据栈同步压入数据
this.stackData.push(newNum);
}
//从栈中弹出元素
public int pop()
{
if(this.stackData.isEmpty())
{
throw new RuntimeException("Your Stack is Empty");
}
int value=this.stackData.pop();
if(value==this.getMin())
{
this.stackMin.pop();
}
return value;
}
//返回栈中的最小值
public int getMin()
{
if(this.stackMin.isEmpty())
{
throw new RuntimeException("Your Stack is Empty");
}
//获取存储最小数据的栈的顶部数据
return this.stackMin.peek();
}
public static void main(String[] args) {
getMin stack1=new getMin();
stack1.push(3);
System.out.println(stack1.getMin());
stack1.push(1);
System.out.println(stack1.getMin());
stack1.push(0);
System.out.println(stack1.getMin());
stack1.push(4);
System.out.println(stack1.getMin());
stack1.pop();
System.out.println(stack1.getMin());
}
}
左神的代码:
package chapter_1_stackandqueue;
import java.util.Stack;
public class Problem_01_GetMinStack {
//解法一
public static class MyStack1 {
private Stack<Integer> stackData;
private Stack<Integer> stackMin;
public MyStack1() {
this.stackData = new Stack<Integer>();
this.stackMin = new Stack<Integer>();
}
public void push(int newNum) {
if (this.stackMin.isEmpty()) {
this.stackMin.push(newNum);
} else if (newNum <= this.getmin()) {
this.stackMin.push(newNum);
}
this.stackData.push(newNum);
}
public int pop() {
if (this.stackData.isEmpty()) {
throw new RuntimeException("Your stack is empty.");
}
int value = this.stackData.pop();
if (value == this.getmin()) {
this.stackMin.pop();
}
return value;
}
public int getmin() {
if (this.stackMin.isEmpty()) {
throw new RuntimeException("Your stack is empty.");
}
return this.stackMin.peek();
}
}
//解法二
public static class MyStack2 {
private Stack<Integer> stackData;
private Stack<Integer> stackMin;
public MyStack2() {
this.stackData = new Stack<Integer>();
this.stackMin = new Stack<Integer>();
}
public void push(int newNum) {
if (this.stackMin.isEmpty()) {
this.stackMin.push(newNum);
} else if (newNum < this.getmin()) {
this.stackMin.push(newNum);
} else {
int newMin = this.stackMin.peek();
this.stackMin.push(newMin);
}
this.stackData.push(newNum);
}
public int pop() {
if (this.stackData.isEmpty()) {
throw new RuntimeException("Your stack is empty.");
}
this.stackMin.pop();
return this.stackData.pop();
}
public int getmin() {
if (this.stackMin.isEmpty()) {
throw new RuntimeException("Your stack is empty.");
}
return this.stackMin.peek();
}
}
public static void main(String[] args) {
MyStack1 stack1 = new MyStack1();
stack1.push(3);
System.out.println(stack1.getmin());
stack1.push(4);
System.out.println(stack1.getmin());
stack1.push(1);
System.out.println(stack1.getmin());
System.out.println(stack1.pop());
System.out.println(stack1.getmin());
System.out.println("=============");
MyStack1 stack2 = new MyStack1();
stack2.push(3);
System.out.println(stack2.getmin());
stack2.push(4);
System.out.println(stack2.getmin());
stack2.push(1);
System.out.println(stack2.getmin());
System.out.println(stack2.pop());
System.out.println(stack2.getmin());
}
}