使用数组实现栈的两个功能（pop,push）

在这里插入代码片package stack;

import java.util.Scanner;

public class ArrayStackDemo {

	public static void main(String[] args) {
		ArrayStack stack = 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("pop:出栈");
			System.out.println("push:入栈");
			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":
				int res=stack.pop();
				System.out.println("出栈的数据是："+res);
				break;
			case "exit":
				scanner.close();
				loop = false;
				break;
			default:
				break;
			}
		}
		System.out.println("程序退出了");
	}

}

class ArrayStack {
	private int maxSize;// 栈的大小
	private int[] stack;// 数组模拟栈，数据放在该数组中
	private int 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;
	}

	// 出栈-pop
	public int pop() {
		if (isEmpty()) {
			System.out.println("栈空");
			return -1;
		}
		int value = stack[top];
		top--;
		return value;
	}

	// 显示栈
	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]);
		}
	}
}