简易静态栈的模拟

使用循环数组来实现

package QueueImpl_Array;

import java.util.Random;

/**
 * 实现步骤：
 * 队列特点;先进先出，所以可以让front指针指向移出的数，end指针指向插入的数
 * maxSize:数组长度
 * 头指针：front
 * 尾指针：end
 * 队列长度：lenth
 *
 */

public class demo_Array {
    public static int length = 0;
    public static int maxSize = 20;
    public static int front = 0;
    public static int end = 0;
    public static  int[] queueArray = new int[maxSize];


    public static void main(String[] args) {

//        Random r = new Random();

        System.out.println(demo_Array.pick());

        for (int i = 0; i < 15; i++) {
            demo_Array.insert(i);

        }

        for (int i = 0; i < queueArray.length; i++) {
            System.out.println("队列中"+"第"+i+"个值为："+queueArray[i]);

        }
        for (int i = 0; i < 10; i++) {
            demo_Array.remove();

        }

        for (int i = 20; i < 30; i++) {
            demo_Array.insert(i);

        }
        System.out.println(demo_Array.pick());





    }

    
    public static boolean isFull() {
        if(length == 0)
            return true;
        return false;
    }

    public static boolean isEmpty(){
        if(length == maxSize)
            return true;
        return false;
    }

    public static void insert(int insertData){
        if(length == maxSize)
            System.out.println("队列已满，无法插入");
        else if(end == maxSize - 1) {
            end =0;
            queueArray[end] = insertData;
        }
        else {
            queueArray[end++] = insertData;
            length++;
        }

    }

    public static int remove(){
        if(length == 0)
            System.out.println("队列已空，无法消除");
        else if(front == maxSize - 1){
            front = 0;
            length--;
            return queueArray[front];

        }
        length--;

        return queueArray[front++];

    }

    public static int pick(){
        return queueArray[front];
    }


}