问题:
数组是最简单的一种数据结构。我们经常碰到的一个基本问题,就是寻找整个数组中的最大数,或者最小的数。这是我们会扫描一遍数组,把最大(最小)的数找出来。
解法:
声明三个栈,分别为Stack、MinStack、MaxStack。Stack用于保存数组,MinStack和MaxStack用于保存最小值和最大值。以最小值为例:如果当前入栈的元素比原来栈中的最小值还小,则把这个值压入压入保存最小元素的栈中;在出栈时,如果当前出栈的元素恰好为当前栈中的最小值,保存最小值的栈顶元素也出栈,使得当前最小值变为其入栈之前的哪个最小值。
程序:
import java.util.*;
/*
*@author 李洪岩
* @csdn Unixmale
*/
class Node{
int data;
Node next;
public Node(int data){
this.data = data;
this.next = null;
}
}
class Stack{
Node top = null;
Node newNode = null;
int size = 0;
public boolean isEmpty(){
return size<=0;
}
public void push(int data){
newNode = new Node(data);
newNode.next = top;
top = newNode;
this.size++;
}
public int pop(){
int data = top.data;
top = top.next;
this.size--;
return data;
}
public int getTopData(){
int data = top.data;
return data;
}
public int capacity(){
return this.size;
}
}
class MaxMinStack{
Stack stack;Stack minStack;Stack maxStack;
{
stack = new Stack();
minStack = new Stack();
maxStack = new Stack();
}
public void push(int data){
stack.push(data);
if(minStack.isEmpty()&&maxStack.isEmpty()){
minStack.push(data);
maxStack.push(data);
}else if(minStack.isEmpty()&&!maxStack.isEmpty()){
minStack.push(data);
if(data>maxStack.getTopData()){
maxStack.push(data);
}
}else if(!minStack.isEmpty()&&maxStack.isEmpty()){
maxStack.push(data);
if(data<minStack.getTopData()){
minStack.push(data);
}
}else{
if(data>maxStack.getTopData()){
maxStack.push(data);
}else if(data<minStack.getTopData()){
minStack.push(data);
}
}
}
public int pop(){
int data = stack.pop();
if(data == minStack.getTopData()){
minStack.pop();
}else if(data == maxStack.getTopData()){
maxStack.pop();
}
return data;
}
public int minStackPop(){
return minStack.pop();
}
public int maxStackPop(){
return maxStack.pop();
}
public int getMaxStackSize(){
return maxStack.capacity();
}
public int getMinStackSize(){
return minStack.capacity();
}
}
public class Demo210{
public static void main(String[] args){
MaxMinStack mms = new MaxMinStack();
int[] array = {3,1,5,9,7,2,4,8,6,10,0};
for(int i=0;i<array.length;i++){
mms.push(i);
}
System.out.println("max:"+mms.maxStackPop());
System.out.println("min:"+mms.minStackPop());
System.out.println("stack size:"+mms.stack.capacity());
}
}