java数组对队列怎么操作

<code class="java">int[] queue = new int[size];
int head = 0;
int tail = 0;</code>

<code class="java">public void enqueue(int item) {
    // 判断队列是否已满
    if ((tail + 1) % queue.length == head) {
        throw new IllegalStateException("Queue is full");
    }

    // 将新元素添加到数组尾部
    queue[tail] = item;
    tail = (tail + 1) % queue.length;
}</code>

<code class="java">public int dequeue() {
    // 判断队列是否为空
    if (head == tail) {
        throw new IllegalStateException("Queue is empty");
    }

    // 获取队首元素
    int item = queue[head];
    head = (head + 1) % queue.length;
    return item;
}</code>

<code class="java">public boolean isEmpty() {
    return head == tail;
}</code>

<code class="java">public boolean isFull() {
    return (tail + 1) % queue.length == head;
}</code>

<code class="java">public int size() {
    return (tail - head + queue.length) % queue.length;
}</code>

<code class="java">public void clear() {
    head = 0;
    tail = 0;
}</code>