代码
package com.afmobi;
import static org.assertj.core.api.Assertions.atIndex;
import java.util.Scanner;
public class ArrayStackDemo {
public static void main(String[] args) {
ArrayStack arrayStack = new ArrayStack(4);
boolean loop = true; //控制是否退出
Scanner scanner = new Scanner(System.in);
while (loop) {
System.out.println("show: 显示栈");
System.out.println("push: 入栈");
System.out.println("pop: 出栈");
System.out.println("exit: 离开栈");
System.out.println("输入你的选择");
String key = scanner.next();
switch (key) {
case "show":
arrayStack.list();
break;
case "push":
System.out.println("输入一个数字");
int nextInt = scanner.nextInt();
arrayStack.push(nextInt);
break;
case "pop":
try {
int pop = arrayStack.pop();
System.out.printf("出栈的数据是 %d\n",pop);
} catch (Exception e) {
// TODO Auto-generated catch block
System.out.println(e.getMessage());
}
break;
case "exit":
scanner.close();
loop = false;
break;
default:
break;
}
}
}
}
class ArrayStack{
private int maxSize;//栈的大小
private int[] stack;//用数组模拟栈,存放数据
private int top = -1; // 表示栈顶,初始化为-1
public ArrayStack(int maxSize) {
super();
this.maxSize = maxSize;
stack = new int[this.maxSize];
// TODO Auto-generated constructor stub
}
// 栈满
public boolean isFull() {
return top == maxSize - 1;
}
// 栈空
public boolean isEmpty() {
return top == - 1;
}
// 入栈
public void push(int value) {
if (isFull()) {
System.out.println("栈已满!!!");
}
top++;
stack[top] = value;
}
// 出栈
public int pop() {
if (isEmpty()) {
throw new RuntimeException("栈已空!!!!");
}
int data = stack[top];
top--;
return data;
}
// 遍历栈
public void list(){
if (isEmpty()) {
System.out.println("栈空,没有数据");
}
for (int i = top; i >= 0; i--) {
System.out.printf("stack[%d]=%d\n", i,stack[i]);
}
}
}
测试结果: