Java有关队列的基本操作

package Queue;

public class MyQueue {
    //定义数组
    private int[] array;
    //对头指针
    private int front;
    //队尾指针
    private int rear;

    //定义队列的构造方法(类似数组)
    public MyQueue(int capacity){
        this.array=new int[capacity];
    }

    //入队操作(element:入队元素)
    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(front==rear){
            throw new Exception("队满!!!");
        }
        int deElement=array[front];
        front=(front+1)%array.length;
        return deElement;
    }

    //输出队列
    public void output(){
        for(int i=front;i!=rear;i=(i+1)%array.length){
            System.out.print(array[i]+" ");
        }
    }

    public static void main(String[] args) throws Exception{
        MyQueue myQueue=new MyQueue(6);
        myQueue.enQueue(1);
        myQueue.enQueue(2);
        myQueue.enQueue(3);
        myQueue.enQueue(4);
        myQueue.enQueue(5);
        myQueue.deQueue();
        myQueue.deQueue();
        myQueue.enQueue(6);
        myQueue.enQueue(7);
        myQueue.output();
    }
}