用数组实现环形队列

用数组实现环形队列

1.概述

环形队列解决了上篇用数组实现的队列的缺点，即当添加了若干元素之后，再取出元素，数组前面的位置就无法再存入值。

2.代码实现

package com.bhy.test;

public class Demo2 {
    public static void main(String[] args) {
        CircleQueue queue = new CircleQueue(4);
        queue.add(1);
        queue.add(2);
        queue.add(3);
        queue.showQueue();
        queue.take();
        queue.take();
        queue.showQueue();
        queue.add(5);
        queue.add(6);
        queue.take();
        queue.add(7);
        queue.showQueue();
    }
}
class CircleQueue{
    private int maxSize;
    private int[] arr;
    private int front;
    private int rear;

    public CircleQueue(int maxSize) {
        this.maxSize = maxSize;
        arr = new int[maxSize];
    }

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

    public boolean isFull() {
       return (rear+1) % maxSize==front;
    }

    public void add(int ele) {
        if (isFull()) {
            throw new RuntimeException("队列已满，不能添加!");
        }
        arr[rear] = ele;
        //使rear加1，且rear的范围在0到maxSize之间
        rear =(rear + 1)%maxSize;

    }

    public int take() {
        if (isEmpty()) {
            throw new RuntimeException("队列已经空了，不能再取！");
        }
        int temp = arr[front];
        front=(front + 1)%maxSize;
        return temp;

    }
    public void showQueue() {
        for (int i : arr) {
            System.out.print(i + "\t");
        }
        System.out.println();
    }
}