数组栈

利用数组实现栈

代码实现

  1. import java.util.Scanner;
  3. /**
  4.  * @author laoduan
  5.  * @create 2020-04-10-17:21
  6.  */
  7. public class ArrayStackDemo {
  8.     public static void main(String[] args) {
  9.         Arraystack stack = new Arraystack(4);
  10.         String key = "";
  11.         boolean loop = true;
  12.         Scanner scanner = new Scanner(System.in);
  14.         while (loop){
  15.             System.out.println("------------------------");
  16.             System.out.println("show:显示栈");
  17.             System.out.println("exit:退出程序");
  18.             System.out.println("pop:出栈");
  19.             System.out.println("push:入栈\n");
  20.             System.out.println("输入你的选择\n");
  22.             key = scanner.next();
  23.             switch (key){
  24.                 case "show":
  25.                     stack.list();
  26.                     break;
  27.                 case "push":
  28.                     System.out.println("请输入一个数");
  29.                     int value = scanner.nextInt();
  30.                     stack.push(value);
  31.                     break;
  32.                 case "pop":
  33.                     try {
  34.                         stack.pop();
  36.                     }catch (Exception e){
  37.                         System.out.println(e.getMessage());
  38.                     }
  39.                     break;
  40.                 case "exit":
  41.                     scanner.close();
  42.                     loop=false;
  43.                     break;
  44.                 default:
  45.                     break;
  47.             }
  49.         }
  50.         System.out.println("程序退出");
  51.     }
  52. }
  55. class Arraystack{
  56.     private int maxSize;//栈的大小
  57.     private int[] stack;//数组
  58.     private int top = -1;
  61.     public Arraystack(int maxSize){
  62.         this.maxSize=maxSize;
  63.         stack=new int [this.maxSize];
  64.     }
  65.     //栈满
  66.     public boolean isFull(){
  67.         return top==maxSize-1;
  68.     }
  69.     //栈空
  70.     public boolean isEmpty(){
  71.         return top==-1;
  72.     }
  73.     //入栈
  74.     public void push(int value){
  75.         if(isFull()){
  76.             System.out.println("栈满，不能入栈");
  77.             return;
  78.         }
  79.         top++;
  80.         stack[top]=value;
  81.     }
  82.     //出栈
  83.     public int pop(){
  84.         if (isEmpty()){
  85.             throw new RuntimeException("栈空");
  86.         }
  87.         top--;
  88.         return stack[top+1];
  89.     }
  90.     //遍历栈
  91.     public void list(){
  92.         if (isEmpty()){
  93.             System.out.println("栈空，不能遍历");
  94.         }
  95.         for (int i=top;i>-1;i--){
  96.             System.out.printf("stacl[%d]=%d\n",i,stack[i]);
  97.         }
  98.     }
  100. }