【双端队列数组ArrayDeque】

ArraydDeque API

import java.util.ArrayDeque;
import java.util.Arrays;

/**
 * array deque api demo
 */
public class ArrayDequeDemo {
    public static void main(String[] args) {
        ArrayDeque<Integer> queue = new ArrayDeque<>();

        // add to last add->addLast
        queue.add(1);
        queue.add(2);
        // [1, 2]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // add to last offer->offerLast
        queue.offer(3);
        queue.offerLast(4);
        // [1, 2, 3, 4]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // add to last
        queue.addLast(5);
        // [1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // add to header push->addFirst
        queue.push(6);
        // [6, 1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // add to header
        queue.addFirst(7);
        // [7, 6, 1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // return add remove header first, poll will return null if queue is empty
        Integer poll = queue.poll();
        // 7
        System.out.println(poll);
        // [6, 1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // return add remove header first, pop will throw an exception if queue is empty
        Integer pop = queue.pop();
        // 6
        System.out.println(pop);
        // [1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // return header first element, peek->peekFirst
        Integer peek = queue.peek();
        // 1
        System.out.println(peek);
        // [1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // peekFirst == peek
        Integer peekFirst = queue.peekFirst();
        // 1
        System.out.println(peekFirst);

        Integer peekLast = queue.peekLast();
        // 5
        System.out.println(peekLast);
        // [1, 2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // remove and return header first
        Integer remove = queue.remove();
        // 1
        System.out.println(remove);
        // [2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // remove exist
        queue.add(10);
        boolean existRemove = queue.remove(10);
        // true
        System.out.println(existRemove);
        // [2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // remove if not exist
        boolean notExistRemove = queue.remove(11);
        // false
        System.out.println(notExistRemove);
        // [2, 3, 4, 5]
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));

        // remove all
        queue.clear();
        // []
        System.out.println(Arrays.toString(queue.toArray(new Integer[]{})));
    }

}