JAVA语言程序设计（基础篇）第十版

Queue类

package adsads;
import java.util.Arrays;
public class Queue {
public int[] element;
public int size;
Queue(){
element=new int[8];
}
public void enQueue(int v){
if(size>=element.length)
{
int[] temp=new int[size*2];
System.arraycopy(element, 0, temp, 0, element.length);
element=temp;
element[size++]=v;
}
element[size++]=v;
}
public int deleteQueue( ){
int temp;
temp=element[0];
for(int i=0;i<=size;i++)
element[i]=element[i+1];
size--;
return temp;
}
public boolean isEmpty(){
return size==0;
}
public int getSize(){
return size;
}
}