필기 데이터 구조 - 동적 배열 기반 대기 열

package com.tc.javabase.datastructure.array.queue;

import com.tc.javabase.datastructure.array.ArrayList;
import com.tc.javabase.datastructure.queue.Queue;

/**
 *            
 *
 *      ：    
 *
 *                          
 *  *        ：
 *  *    ：O(1)
 *  *    ：O(n)
 *  *        :O(1)
 *
 * @param 
 */
public class ArrayQueue implements Queue {

    private ArrayList arrayList;

    public ArrayQueue(int capacity){
        arrayList = new ArrayList<>(capacity);
    }

    public ArrayQueue(){
        arrayList = new ArrayList<>();
    }

    @Override
    public int getSize(){
        return arrayList.getSize();
    }

    @Override
    public boolean isEmpty(){
        return arrayList.isEmpty();
    }

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

    /**
     *   
     *      :O(1)
     * @param e
     */
    @Override
    public void enqueue(E e){
        arrayList.addLast(e);
    }

    /**
     *   
     *      :O(n)
     * @return
     */
    @Override
    public E dequeue(){
        return arrayList.removeFirst();
    }

    /**
     *       
     *      : O(1)
     * @return
     */
    @Override
    public E getFront(){
        return arrayList.getFirst();
    }

    @Override
    public String toString(){
        StringBuilder res = new StringBuilder();
        res.append("Queue: ");
        res.append("front [");
        for(int i = 0; i < arrayList.getSize() ; i ++){
            res.append(arrayList.get(i));
            if(i != arrayList.getSize() - 1)
                res.append(", ");
        }
        res.append("] tail");
        return res.toString();
    }

    public static void main(String[] args) {

        ArrayQueue queue = new ArrayQueue<>();
        for(int i = 0 ; i < 10 ; i ++){
            queue.enqueue(i);
            System.out.println(queue);
            if(i % 3 == 2){
                queue.dequeue();
                System.out.println(queue);
            }
        }
    }
}