队列—C—python

2-1 解密QQ号—用队列实现

C实现

//使用结构体来实现队列操作 #include<stdio.h> struct queue { int data[100]; int head; int tail; }; int main() { int i,n; struct queue q; scanf("%d",&n); q.head=1; q.tail=1; for(i=1;i<=n;i++) scanf("%d",&q.data[q.tail++]); while(q.head<q.tail) { printf("%d ", q.data[q.head]); q.head++; q.data[q.tail]=q.data[q.head]; q.tail++; q.head++; } return 0; }

python实现

import queue def decode_qq(que): while not que.empty(): print(que.get()) que.put(que.get()) if __name__=='__main__': n=int(input('input n:')) que=queue.Queue() for i in range(n): ele=int(input()) que.put(ele) decode_qq(que) while not que.empty(): print(que.get())