Queue(ArrayDeque/PriortyQueue)总结

ArrayDeque 循环数组
增加方法add(E)/offer(E)
删除方法remove()/poll()
获取首元素 element()/peek()

自定义ArrayDeque

```java

```java
class MyArrayDeque<E>{
   
    private E[] elements;
    private int head; //永远指向循环数组的头
    private int tail;//永远指向循环数组的尾
    private static int maxSize = 5;

    public MyArrayDeque(){
   
        this(5);
    }

    public MyArrayDeque(int capacity){
   
        elements = (E[])new Object[capacity];
        maxSize = capacity;
    }

    public void add(E value){
   
        //默认队尾添加
        //判满
        if((tail+1) % maxSize == head){
   
            //扩容
            elements = Arrays.copyOf(elements, 2*maxSize);
            maxSize = elements.length;
        }
        elements[tail] = value;
        tail = (tail+1) % maxSize;
    }

    public E remove(){
   
        //默认队头删除
        if(head == tail){
   
            throw new UnsupportedOperationException("the queue has been empty");
        }
        System.out.println(head);
        E result = elements[head];
        elements[head] = null; //方便垃圾回收
        head = (head +1 )% maxSize;
        return result;
    }

    public E get(){
   
        return elements[head];
    }

    public String toString(){
   
        StringBuilder strs = new StringBuilder();
        for(int i=head; i != tail+1; i=(i+1)%maxSize){
   
            strs.