数组模拟栈的运行原理

/** * @Description 模拟栈运行的一个简单类 */public class InnDemo1 {private int maxSize;public int top;private int[] inn;public InnDemo1(int size){inn=new int[size];top=-1;maxSize=size;}//压栈public Boolean push(int value){if(isFull()){return false;}inn[++top]=value;return true;}//弹栈public int pop(){if(isEmpty()){return -1;}return inn[top--];}//查看栈顶元素public int peek(){if(isEmpty()){return -1;}return inn[top--];}//判断是否满栈public boolean isFull() {if(top>=maxSize-1){return true;}return false;}//判断是否空栈public boolean isEmpty() {if(top<=-1){return true;}return false;}public static void main(String[] args) {InnDemo1 innDemo1=new InnDemo1(10);innDemo1.push(1);System.out.println(innDemo1.top);innDemo1.push(2);System.out.println(innDemo1.top);System.out.println(innDemo1.pop());System.out.println(innDemo1.pop());System.out.println(innDemo1.pop());}}