5.4栈的快速入门(使用数组模拟栈)
package com.atguigu04.stack;
import java.util.Scanner;
public class ArrayStackDemo {
public static void main(String[] args) {
CalculatorArrayStack arrayStack = new CalculatorArrayStack(4);
Scanner scanner = new Scanner(System.in);
boolean loop = true;
String key = "";
while (loop) {
System.out.println("show表示显示栈的数据:");
System.out.println("push表示向栈中添加数据:");
System.out.println("pop表示取出栈中的数据:");
System.out.println("exit表示退出程序:");
System.out.println("请输入指令:");
key = scanner.next();
switch (key) {
case "show":
arrayStack.list();
break;
case "push":
System.out.println("请输入要入栈的数据:");
int value = scanner.nextInt();
arrayStack.push(value);
break;
case "pop":
try {
System.out.println(arrayStack.pop());
break;
} catch (Exception e) {
e.printStackTrace();
}
case "exit":
loop = false;
break;
default:
break;
}
}
}
}
class ArrayStack {
private int maxSize;
private int[] stack;
private int top = -1;
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()){
System.out.println("栈已经满了!");
return;
}
top++;
stack[top] = value;
}
public int pop() throws Exception {
if (isEmpty()) {
throw new Exception("栈为空不能输出数据!");
}
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.println(stack[i]);
}
}
}