import java.util.Scanner;
public class StackDemo {
public static void main(String[] args) {
ArrayStack stack = new ArrayStack(10);
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:出栈");
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":
try {
int res=stack.pop();
System.out.println("出栈:"+res);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case "exit":
scanner.close();
loop=false;
break;
default:
break;
}
}
}
}
class ArrayStack {
private int macSize;//栈的大小
private int[] stack;
private int top = -1;//top表示栈顶,初始化为-1
public ArrayStack(int macSize) {
this.macSize = macSize;
stack = new int[macSize];
}
//栈满
public boolean isFull() {
return top == macSize - 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() {
if (isEmpty()) {
throw new RuntimeException("栈为空");
}
int value = stack[top];
top--;
return value;
}
//显示栈
public void list() {
if (isEmpty()) {
throw new RuntimeException("栈为空");
}
for (int i = top; i >= 0; i--) {
System.out.println("出栈:" + stack[i]);
}
}
}
java数组实现栈的功能
最新推荐文章于 2024-07-15 11:03:37 发布