ArrayStack
public class ArrayStack {
private int maxSize;// 最大的尺寸
private int[] stack;// 使用数组模拟
private int top = -1;// 栈指针 , 初始为-1
public ArrayStack(int maxSize) {// 初始化
this.maxSize = maxSize;
stack = new int[this.maxSize];
}
// 判断是否为空
public boolean isEmpty(){
return top == -1;
}
// 判断是否为满
public boolean isFull(){
return top == maxSize - 1;
}
// 查看栈顶元素
public int peek(){
return stack[top];
}
// 进栈
public void push(int value){
// 判断满栈
if(isFull()){
System.out.println("栈满~~");
return;
}
top++;
stack[top] = value;
}
// 出栈 -- 从栈顶出栈
public int pop(){