Queue的java实现

package com.liu.queue;

public class QueueApp {
    public static void main(String args[])
    {
        Queue theQueue = new Queue(5);
        
        theQueue.insert(10);
        theQueue.insert(20);
        theQueue.insert(30);
        //theQueue.insert(40);
        
        theQueue.remove();
        theQueue.remove();
        theQueue.remove();
        
        theQueue.insert(50);
        theQueue.insert(60);
        theQueue.insert(70);
        theQueue.insert(80);
        
        while(!theQueue.isEmpty())
        {
            long n = theQueue.remove();
            System.out.print(n);
            System.out.print(" ");
        }
        System.out.println("");
    }
}

class Queue
{
    private int maxsize;
    private long[] queArray;
    private int front;
    private int rear;
    private int nItems;
    
    public Queue(int s)
    {
        maxsize = s;
        queArray = new long[maxsize];
        front = 0;
        rear = -1;
        nItems = 0;
    }
    
    public void insert(long j)
    {
        if(rear == maxsize-1)
            rear = -1;//如果尾指针已经到了最后，则循环
        queArray[++rear] = j;
        nItems++;
    }
    
    public long remove()
    {
        long temp = queArray[front++];
        if(front == maxsize)
            front = 0;
        nItems--;
        return temp;
    }
    
    public long peekFront()
    {
        return queArray[front];
    }
    
    public boolean isEmpty()
    {
        return (nItems == 0);
    }
    
    public boolean isFull()
    {
        return (nItems == maxsize);
    }
    
    public int size()
    {
        return nItems;
    }
    
    
}