使用数组实现队列

最新推荐文章于 2024-09-13 16:27:15 发布

憨厚2016

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量88

点赞数

分类专栏：算法文章标签：算法数组队列

本文链接：https://blog.csdn.net/cgk1996/article/details/103112700

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

使用数组实现队列

public class MyQueue {

    private int[] array;
    private int front;
    private int rear;

    public MyQueue(int capacity) {
        this.array = new int[capacity];
    }

    public void enQueue(int element) throws Exception {
        if ((rear + 1) % array.length == front) {
            throw new Exception("队列已满");
        }
        array[rear] = element;
        rear = (rear + 1) % array.length;
    }

    public int deQueue() throws Exception {
        if ((rear == front)) {
            throw new Exception("队列已空");
        }

        int deQueueElement = array[front];
        front = (front + 1) % array.length;
        return deQueueElement;
    }

    public void output() {
        for (int i = front; i != rear; i = (i + 1) % array.length) {
            System.out.println(array[i]);
        }
    }
}