Java 数组模拟栈

/* * 利用数组模拟栈 */package Stack;import java.util.Stack;import Queue.Queue;public class arrStack {     private int maxSize;  //最大值     private int top;        //栈顶指针     private int shen;       //深度     private int[] arrStack;     public arrStack (int s) {        maxSize  =s;        top = -1;        shen = 0;        arrStack = new int[s];    }     //入栈     public void inTo(int s) {        arrStack[++top] = s;        shen ++;    }     //出栈     public int outOf() {        int temp = arrStack[top--];        shen--;        return temp;    }     //是否满     public boolean isFull() {        return shen==maxSize;    }     public int len() {        return shen;    }     //是否空     public boolean isEmp() {        return (shen ==0);    }     public static void main(String[] args) {         arrStack a = new arrStack(5);        a.inTo(1);        a.inTo(2);        a.inTo(3);        a.inTo(4);        a.inTo(5);        System.out.println("出栈："+a.outOf());        System.out.println("出栈："+a.outOf());        System.out.println("栈的深度"+a.len());    }}