簡介

• 用陣列實現佇列的操作

public class MyQueue {
    private int[] elements;

    public MyQueue(){
        elements=new int[0];
    }

    //獲取佇列的大小
    public int size(){
        return elements.length;
    }

    //遍歷佇列
    public void show(){
        for(int i=0;i<elements.length;i++){
            System.out.print(elements[i]+" ");
        }
        System.out.println();
    }

    //入隊
    public void in(int element){
        int[] newArr=new int[elements.length+1];
        for(int i=0;i<elements.length;i++){
            newArr[i]=elements[i];
        }
        newArr[newArr.length-1]=element;
        elements=newArr;
    }

    //出隊
    public int out(){
        if(elements.length<=0){
            throw new RuntimeException("佇列為空");
        }
        int element=elements[0];
        int[] newArr=new int[elements.length-1];
        for(int i=0;i<newArr.length;i++){
            newArr[i]=elements[i+1];
        }
        elements=newArr;
        return element;
    }
}