顺序结构的队列

#include<malloc.h> #include<stdio.h> #include<stdlib.h> typedef int elemtype; #define maxsize 10 typedef struct{elemtype data[maxsize];int front;int rear;}*SQueue;void creatqueue(SQueue &q){q=(SQueue )malloc(sizeof(SQueue));q->front=q->rear=-1;}void inSQueue(SQueue &q,elemtype e){q->rear++;q->data[q->rear]=e;}int  outSQueue(SQueue &q,elemtype &e){q->front++;e=q->data[q->front];return e;}int main(){ int i,j,k,a,e=0;SQueue q;creatqueue(q);printf("输入队列中有几个元素：\n");scanf("%d",&i);printf("输入队列中各元素的值：\n");for(j=i;j>0;j--){scanf("%d",&k);inSQueue(q,k);}while(q->front!=q->rear){a=outSQueue(q,e);printf("%d",a);}return 0;}