栈学习笔记二 代码实现

package com.hao.firstdemo.datastruct;

import java.util.Scanner;

/**
 * @author haoxiansheng
 * @data 2020/5/2
 */
public class ArrayStackTest {
    public static void main(String[] args) {

        ArrayStack arrayStack = new ArrayStack(4);
        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 出栈");
            key = scanner.next();
            switch (key) {
                case "show":
                    arrayStack.show();
                    break;
                case "push":
                    System.out.println("输入");
                    int id = scanner.nextInt();
                    arrayStack.push(id);
                    break;
                case "pop":
                    arrayStack.pop();
                    break;
                case "exit":
                    scanner.close();
                    System.out.println("退出");
                    break;
                default:
                    break;
            }
        }
    }
}

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];
    }

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

    /***
     * 栈是否为null
     * @return
     */
    public boolean isEmpty() {
        return top == -1;
    }

    /**
     * 入栈
     *
     * @param value
     */
    public void push(int value) {
        if (isFull()) {
            System.out.println("栈已经满了");
            return;
        }
        top++;
        stack[top] = value;
    }

    /**
     * 出栈
     *
     * @return
     */
    public int pop() {
        if (isEmpty()) {
            //抛出异常
            throw new RuntimeException("stack is empty");
        }
        int value = stack[top];
        top--;
        return value;
    }

    public void show() {
        if (isEmpty()) {
            System.out.println("stack is empty");
            return;
        }
        //需要从栈顶返回
        for (int i = top; i >= 0; i--) {
            System.out.printf("stack[%d]=%d\n", i, stack[i]);
        }
    }
}