数据结构之循环队列

队列：其原理就像火车的车厢进出隧道，先进的先出，后进的后出。(first in first out)代码实现如下：

package com.ll.dataStruct;
/**
 * 
<p>Title:MyCycleQueue </p>
<p>Description: 循环队列</p>
<p>Company: </p>
 * @author ll
 * @date 2017-10-29下午17:51:27
 *
 */
public class MyQueue{
    private long []arr;//底层数组实现
    private int front;//队头
    private int rear;//队尾
    private int elements;//队列中的有效元素
    //默认的构造器
    public MyQueue(){
      arr = new long[10];
      front = 0;
      rear = -1;
      elements = 0;
    }
    //带参数的构造器
    public MyQueue(int maxSize){
      arr = new long[maxsize];
      front = 0;
      rear = -1;
      elements = 0;
    }
    /**
     * 从队尾插入元素
     */
    public void insert(long value){
      if(rear == arr.length -1){
         rear = -1;
      }
      arr[++rear] = value;
      elements++;
    }
    /**
     * 从队头删除元素
     */
    public long remove(){
      if(front == arr.length){
         front = 0;
      }
      elements--;
      return arr[front++];
    }
    /**
     * 查找元素
     */
    public long peek(){
      return arr[front];
    }
    /**
     * 判断是否已满
     */
    public boolean isFull(){
      return arr.lenght == elements;
    }
    /**
     * 判断是否为空
     */
    public boolean isEmpty(){
      return elements == 0;
    }
}