首先是创建一个数据结构包括尺寸、数组模拟栈、定义栈顶top。构造器初始化size然后创建栈并且传入size。接着判断空、满
进行出入栈操作、显示,最后测试创建对象初始化添加删除查看
package com.Stack;
import java.util.Scanner;
/**
* @Auther: 大哥的叔
* @Date: 2019/7/30 07:30
* @Description:
*/
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("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.printf("出栈的数据是 %d\n", res);
} catch (Exception e) {
// TODO: handle exception
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;// 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("空");
return;
}
for (int i = top; i >=0; i--) {
System.out.printf("stack[%d]=%d\n",i,stack[i]);
}
}
}