java 栈结构入门

package com.mulun.stack;

import java.util.Scanner;

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

        // 创建栈
        ArrayStack stack = new ArrayStack(4);

        Scanner scanner = new Scanner(System.in);
        String key = "";

        // 控制是否退出菜单
        boolean loop = true;

        while (loop) {
            System.out.println("show：表示显示栈");
            System.out.println("push：添加数据到栈");
            System.out.println("pop：从栈取出数据");
            System.out.println("exit：退出程序");
            System.out.print("请输入你的选择：");
            key = scanner.next();

            System.out.println("=======================================");
            
            switch (key) {
                case "show":
                    try {
                        stack.list();
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case "push":
                    try {
                        System.out.print("请输入一个数：");
                        int value = scanner.nextInt();
                        stack.push(value);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    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:
                    break;
            }
        }

        System.out.println("=======================================");
        System.out.println("程序已退出");
    }
}

/**
 * 表示栈结构
 *
 * @author Mulun
 */
class ArrayStack {

    /**
     * 栈的大小
     */
    private int maxSize;
    /**
     * 数据
     */
    private int[] stack;
    /**
     * 指针，指向栈顶 - 默认为-1
     */
    private int top = -1;

    /**
     * 创建栈
     *
     * @param maxSize 栈的大小
     */
    public ArrayStack(int maxSize) {
        this.maxSize = maxSize;
        stack = new int[this.maxSize];
    }

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

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

    /**
     * 入栈
     */
    public void push(int value) {
        if (isFull()) {
            throw new RuntimeException("栈已满");
        }

        // 指针后移，指向栈顶
        top++;
        // 入栈
        stack[top] = value;
    }

    /**
     * 出栈
     */
    public int pop() {
        if (isEmpty()) {
            throw new RuntimeException("栈空");
        }

        // 弹出栈顶的数据
        int value = stack[top];
        // 指针迁移，重新指向栈顶
        top--;
        return value;
    }

    /**
     * 遍历栈
     */
    public void list() {
        if (isEmpty()) {
            throw new RuntimeException("栈空");
        }
        // 定义指针，用于遍历
        int i = top;

        while (true) {
            if (i < 0) {
                break;
            }
            System.out.printf("stack[%d]=%d\n", i, stack[i]);
            i--;
        }
    }
}