1. package com.atguigu.stack;
    3. import java.util.Scanner;
    5. /**
    6.  * @author Dxkstart
    7.  * @create 2021-10-07-18:41
    8.  */
    9. public class ArrayStackDemo {
    10.     public static void main(String[] args) {
    11.         //测试ArrayStack
    13.         //先创建一个ArrayStack对象 ---> 表示栈
    14.         ArrayStack stack = new ArrayStack(5);
    16.         int key = 0;
    17.         Scanner scanner = new Scanner(System.in);
    18.         boolean b = true;
    20.         l:
    21.         while (b) {
    22.             System.out.println("1.显示栈的所有数据");
    23.             System.out.println("2.添加数据");
    24.             System.out.println("3.取出数据");
    25.             System.out.println("4.退出程序");
    27.             key = scanner.nextInt();
    30.             switch (key) {
    31.                 case 1:
    32.                     try {
    33.                         stack.list();
    34.                     } catch (Exception e) {
    35.                         System.out.println(e.getMessage());
    36.                     }
    37.                     break;
    38.                 case 2:
    39.                     System.out.println("请输入一个数");
    40.                     stack.push(scanner.nextInt());
    41.                     break;
    42.                 case 3:
    43.                     try {
    44.                         int value = stack.pop();
    45.                         System.out.printf("出栈的数据是%d \n", value);
    46.                     } catch (Exception e) {
    47.                         System.out.println(e.getMessage());
    48.                     }
    49.                     break;
    50.                 case 4:
    51.                     scanner.close();
    52.                     System.out.println("再见~~~~");
    53.                     break l;
    54.             }
    55.         }
    58.     }
    59. }
    61. //定义一个ArrayStack表示栈
    62. class ArrayStack {
    63.     private int maxSize;//栈的大小
    64.     private int[] stack;//数组，数组模拟栈，数据就放在该数组中
    65.     private int top = -1;//top表示栈顶，初始化为-1
    67.     //构造器
    68.     //初始化栈
    69.     public ArrayStack(int maxSize) {
    70.         this.maxSize = maxSize;
    71.         stack = new int[maxSize];
    72.     }
    74.     //栈满
    75.     public boolean isFull() {
    76.         return top == maxSize - 1;
    77.     }
    79.     //栈空
    80.     public boolean isEmpty() {
    81.         return top == -1;
    82.     }
    84.     //入栈 - push
    85.     public void push(int value) {
    86.         //先判断栈是否满
    87.         if (isFull()) {
    88.             System.out.println("栈满");
    89.             return;
    90.         }
    91.         top++;
    92.         stack[top] = value;
    93.     }
    95.     //出栈 - pop,将栈顶的数据返回
    96.     public int pop() {
    97.         //先判断是否为空
    98.         if (isEmpty()) {
    99.             //抛出异常
    100.             throw new RuntimeException("栈空");
    101.         }
    102.         int value = stack[top];
    103.         top--;
    104.         return value;
    105.     }
    107.     //显示栈的所有数据【遍历栈】
    108.     public void list() {
    109.         //先判断是否为空
    110.         if (isEmpty()) {
    111.             //抛出异常
    112.             throw new RuntimeException("栈空");
    113.         }
    114.         //需要从栈顶开始显示数据
    115.         for (int i = top; i >= 0; i--) {
    116.             System.out.printf("stack[%d] = %d \n", i, stack[i]);
    117.         }
    119.     }
    121. }