队列

#include<stdio.h>/*队列*/int a[100]={1,2,0,5,4,4,6,8,0,3};int main(int intval,char **charval){    int head=0,tail=10;/*head指向第一元素，tail指向最后一个元素下一个*/    while(head<tail)    {        printf("%d",a[head]);/*出队*/         head++;        a[tail]=a[head];/*进队*/         tail++;        head++;    }     printf("\n");    return 0;}

封装之后：

#include<stdio.h>struct queue {    int data[100];    int head;    int tail;}; int main(int intval,char **charval){    struct queue q;    q.head=0;    q.tail=10;    for(int i=0;i<10;++i)        scanf("%d",&q.data[i]);    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;}