队列代码实现

public class test1 {
    public static void main(String[] args) {
        myqueue mq=new myqueue();
        System.out.println(mq.isempty());
        mq.add(90);
        mq.add(403);
        mq.add(430);
        System.out.println(mq.poll());
    }
}



public class myqueue {
    int[] elements;//即队列底层是数组
    myqueue(){
        elements=new int[0];
    }

    public void add(int element){//入队操作
        int[] newarr=new int[elements.length+1];
        for(int i=0;i<elements.length;i++){
            newarr[i]=elements[i];

        }
        newarr[elements.length]=element;
        elements=newarr;
    }

    public int poll(){//出队操作
        int[] newarr=new int [elements.length-1];
        for (int i = 0; i < newarr.length; i++) {
            newarr[i]=elements[i+1];
        }
        elments=newarr;
        return elements[0];
    }

    public boolean isempty(){//判断是否为空。
        return elements.length==0;
    }

}