队列

package TestTwo.demo1;

public class MyQueue {
    int[] elements;

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

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

    //出队
    public int pull() {
        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;
    }
    public boolean isEmpty(){
        return elements.length==0;
    }
}

package TestTwo.demo1.test;

import TestTwo.demo1.MyQueue;

public class TestMyQueue {
    public static void main(String[] args) {
        MyQueue mq = new MyQueue();
        System.out.println(mq.isEmpty());
        mq.push(9);
        mq.push(8);
        mq.push(7);
        System.out.println(mq.pull());
        mq.push(6);
        System.out.println(mq.pull());
        System.out.println(mq.isEmpty());
    }
}