线性队列（基本功能）

#include <stdio.h>
#include<stdlib.h>
#define max 100
typedef struct queue{
    int data[max];
    int fount,real;
}*squeue,queue;
squeue init(){
    squeue s=(squeue)malloc(sizeof (queue));
    if(s){
        s->fount=0;
        s->real=0;
    }
    return s;
}
void insert(squeue s,int x){
    if((s->real+1)%max==s->fount)
    {
        printf("队满");
    }else {
        s->real=(s->real+1)%max;
        s->data[s->real]=x;
    }
}
void put_queue(squeue s,int *x)
{
    if(s->fount==s->real){
        printf("队空");
    }
    s->fount=(s->fount+1)%max;
    *x=s->data[(s->fount)];
    printf("-->%d",*x);
}
void pri(squeue s)
{

    while (s->fount!=s->real) {
        printf("-->%d",s->data[(s->fount+1)%max]);
        s->fount=(s->fount+1)%max;
    }

}
int main()
{
    squeue s=init();
    int x;
    for(int i=1;i<=5;i++){
        insert(s,i);
    }
     put_queue(s,&x);
     printf("\n");
    pri(s);
    return 0;
}