01-java数组实现队列

public class ArrQueueDemo1 {
    public static void main(String[] args) throws Exception {
    }


}

class ArrayQuere {
    private int maxSize;
    private int front;
    private int rear;
    private int[] arr;

    public ArrayQuere(int maxSize) {
        this.maxSize = maxSize;
        front = -1;
        rear = -1;
        arr = new int[maxSize];
    }


    public boolean isFull() {
        return rear == maxSize - 1;
    }

    public boolean isEmpty() {
        return rear == maxSize;
    }

    public void addQueue(int n) {
        if (isFull()) {
            System.out.println("队列满");
            return;
        }

        rear++;
        arr[rear] = n;
    }

    public int getQueue() {
        if (isFull()) {
            throw new NullPointerException("队列满");
        }

        front++;
        return arr[front];
    }

    public void show() {
        if (isFull()) {
            System.out.println("队列空");
            return;
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.printf("arr[%s]=%sn",i,arr[i]);
        }


    }

}

 - List item