数据结构-动态数组实现普通队列(java)

Queue

/**
 * Copyright (c) 2020 bigdata ALL Rights Reserved
 * Project: learning
 * Package: core.queuue
 * Version: 1.0
 *
 * @author qingzhi.wu 2020/7/13 16:51
 */
public interface Queue<E> {

    void enqueue(E e);

    E dequeue();

    E getFront();

    int getSize();

    boolean isEmpty();

}

ArrayQueue

package core.queuue;

import core.array.MyArrayList;

/**
 * Copyright (c) 2020 bigdata ALL Rights Reserved
 * Project: learning
 * Package: core.queuue
 * Version: 1.0
 *
 * @author qingzhi.wu 2020/7/13 16:53
 */
public class ArrayQueue<E> implements Queue<E> {

    private MyArrayList<E> data ;

    public ArrayQueue(){
        data = new MyArrayList<E>();
    }
    public ArrayQueue(int capacity){
        data  = new MyArrayList<E>(capacity);
    }


    public void enqueue(E e) {
        data.addLast(e);
    }

    public E dequeue() {
        return data.removeFirst();
    }

    public E getFront() {
        return data.getFirst();
    }

    public int getSize() {
        return data.getSize();
    }

    public boolean isEmpty() {
        return data.isEmpty();
    }

    public int getCapacity(){
        return data.getCapacity();
    }

    @Override
    public String toString() {
       StringBuilder res = new StringBuilder();

       res.append("Queue: ");
       res.append(" front [");
        for (int i = 0; i < data.getSize(); i++) {
            res.append(data.get(i));
            if (i != data.getSize()-1){
                res.append(", ");
            }
        }
        res.append("] tail");
        return res.toString();
    }
}