package TuiLie_pac;
class Queue{
public static final int SIZE=100;
public int[] data;
public int data_fornt;
public int data_rear;
public Queue(){
data=new int[SIZE];
data_fornt=data_rear=0;
}
public void push(int i){
data[data_rear++]=i;
}
public int pop( ){
return data[data_fornt++];
}
public boolean isEmpty( ){
boolean res=false;
if(data_fornt==data_rear){
res=true;
}
return res;
}
}
public class Queu_shixian {
public static void main(String[] args){
Queue myQueue=new Queue();
myQueue.push(1);
myQueue.push(3);
myQueue.push(4);
myQueue.push(5);
myQueue.push(2);
myQueue.push(0);
while(!myQueue.isEmpty()){
System.out.print(myQueue.pop()+" ");
}
}
}