一、实现栈的思路:
- 使用数组来模拟栈
- 定义一个top表示栈顶,初始化为-1;
- 入栈的操作,当有数据加入栈时,top++;stack[top]=data;
- 出栈的操作,int value=stack[top];top–;return value;
二、代码演示
package com.stack;
import java.util.Arrays;
import java.util.Scanner;
public class ArrayStackDemo {
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:从栈取出数据");
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);
case "pop":
try {
int res = arrayStack.pop();
System.out.printf("出栈的数据为%d\n",res);
}
catch (Exception e){
System.out.println(e.getMessage());
}
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[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(){
if (isEmpty()){
throw new RuntimeException("栈空,没有数据");
}
int value = stack[top];
top--;
return value;
}
public void list(){
if (isEmpty()){
System.out.println("栈空,没有数据");
}
for (int i = top;i>=0;i--){
System.out.printf("stavk[%d]=%d\n",i,stack[i]);
}
}
}