栈（数组实现）

package ArrayStack;

public class ArrayStack {
    private int maxSize;//栈的大小
    private int[] stack;//数组模拟栈
    private int top=-1;//栈顶指针

    public ArrayStack() {
    }

    //构造器
    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 list(){
        if (isEmpty()){
            System.out.println("栈空！");
            return;
        }
        //从栈顶打印
        for (int i=top;i>=0;i--){
            System.out.printf("stack[%d] = %d\n",i,stack[i]);
        }
    }

}

package ArrayStack;

import java.util.Scanner;

public class ArrayStackDemo {
    public static void main(String[] args) {

        ArrayStack stack=new ArrayStack(5);
        String key="";
        boolean loop=true;
        Scanner scanner=new Scanner(System.in);
        while(loop){
            System.out.println("show: 显示栈");
            System.out.println("exit: 退出程序");
            System.out.println("push: 入栈");
            System.out.println("pop: 出栈");
            System.out.println("请输入你的选择：");
            key=scanner.next();
            switch (key){
                case "show":
                    stack.list();
                    break;
                case "push":
                    System.out.println("请输入一个数：");
                    int value=scanner.nextInt();
                    stack.push(value);
                    break;
                case "pop":
                    try{
                        int res=stack.pop();
                        System.out.printf("出栈的数据是 %d \n",res);
                    }catch (Exception e){
                        System.out.println(e.getMessage());
                    }
                    break;
                case "exit":
                    scanner.close();
                    loop=false;
                    break;
                    default:
                        System.out.println("输入有误！");
            }
        }
    }
}