使用数组模拟栈

package ArrayStack;
/*
用数组模拟栈
 */
public class ArrayStackDdemo {
    public static void main(String[] args) {

    }
}
class ArrayStack{
    private int maxSize;//栈的最大容量
    private int [] stack;
    private int top = -1;//top表示栈顶，初始化为-1

    public ArrayStack(int maxSize){
        this.maxSize = maxSize;
        stack = new int[maxSize];
    }

    //栈是否满
    public boolean isFull(){
        return top == maxSize - 1;
    }

    //判断是否为空
    public boolean isEmpty(){
        return top == -1;
    }

    //入栈
    public void push(int value){
        if(isFull()){
            System.out.println("栈已满，入栈失败");
            return;
        }

        top++;
        stack[top] = value;
    }

    //出栈
    public int pop(){
        if(isEmpty()){
            throw new RuntimeException("栈为空，出栈失败");
        }
        int value = stack[top];
        top--;
        return value;
    }

    //查看栈顶元素
    public int peek(){
        if(isEmpty()){
            throw new RuntimeException("栈为空，查看栈顶元素失败");
        }
        return stack[top];
    }

    //遍历栈
    public void showStack(){
        if(isEmpty()){
            System.out.println("栈为空");
            return;
        }
        while (!isEmpty()){
            System.out.printf("%d ",stack[top]);
            top--;
        }
    }
    
}