private int[] elements;
public MyQueue1() {
elements = new int[0];
}
//入队 -- 类似于数组中的添加
public void add(int element) {
int[] newArr = new int[elements.length + 1];
for (int i = 0; i < newArr.length; i++) {
newArr[i] = elements[i];
}
newArr[elements.length] = element;
elements = newArr;
}
//出队 -- 取出队头元素
public void poll() {
if (elements.length == 0) {
throw new RuntimeException("栈为空");
}
int element = elements[0];
int[] newArr = new int[elements.length - 1];
for (int i = 1; i < elements.length; i++) {
newArr[i - 1] = elements[i];
}
elements = newArr;
}
//判断队列是否为空
public boolean isEmpty() {
return elements.length == 0;
}