算法入门——初级队列

package test;
import java.util.Scanner;
class queue {
int[] data=new int[100];
int head;
int foot;
}
public class 队列2 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
queue s = new queue();
s.head=0;
s.foot=0;
for(int i = 0;i<=8;i++){
int a = in.nextInt();
s.data[i]=a;
s.foot++;
}
while(s.head<s.foot){
System.out.print(s.data[s.head]);
s.head++;
s.data[s.foot]=s.data[s.head];
s.foot++;
s.head++;
}
}
}