蓝桥-算法-队列

public class Queue<T> {
private int[] data; // 存储数据
private int head; // 头
private int tail; // 尾
public static void main(String[] args) {
int[] data = { 0, 6, 3, 1, 7, 5, 8, 9, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0 };
Queue q = new Queue();
q.data = data;
q.tail = 10;
while (q.head < q.tail) {
System.out.println(q.data[q.head]);
q.head++;


q.data[q.tail] = q.data[q.head];
q.tail++;
q.head++;
}
}
}
// 解密QQ，定义QQ数组，实例化q。q.data,q.head队首,q.tail队尾后一位赋值。队列不为空
// 则循环队首输出并出列，新队首放到队尾，加长尾，新队首出列