#include <stdio.h>#include <stdlib.h>#include <malloc.h>#define maxqsize 10#define overlow 0#define error 0#define ok 1typedef struct {char *base;int front;int rear;} sqqueue;int initqueue_sq(sqqueue *q) { //初始化順序隊(duì)q->base = (char *) malloc(maxqsize * sizeof (char));if (!q->base)return overlow; //存儲(chǔ)分配失敗q->front = q->rear = 0;return ok;}int enqueue_sq(sqqueue *q, char e) { //e插入隊(duì)尾作為新元素if ((q->rear + 1) % maxqsize == q->front)return error; //存儲(chǔ)分配失敗q->base[q->rear] = e;q->rear = (q->rear + 1) % maxqsize;return ok;}int dequeue_sq(sqqueue *q, char *e) { //出隊(duì)，返回首元素e的值if (q->front == q->rear)return error;*e = q->base[q->front];q->front = (q->front + 1) % maxqsize;return ok;}int queuelength_sq(sqqueue *q) //求對長{return (q->rear - q->front + maxqsize) % maxqsize;}int queuetraverse_sq(sqqueue q, int(*visit)()) { //遍歷順序循環(huán)隊(duì)int i, n;n = queuelength_sq(&q);for (i = 0; i < n; i++)visit(q.base + i);return ok;}int visit(char (q.base)) {printf("%c", *(q.base));return ok;}int main() {sqqueue q;char e;int i, n, m;initqueue_sq(&q);printf("input the number of the datas:");scanf("%d", &n);for (i = 0; i < n; i++) {fflush(stdin);printf("enter the queue:");scanf("%c", &e);if (!enqueue_sq(&q, e)) {printf("the queue is full!\n");break;}}printf("traverse the queue now:");queuetraverse_sq(q, int(*e));printf("\nthe length of the queue is %d\n", queuelength_sq(&q));printf("input the number of the datas to out:");scanf("%d", &m);for (i = 0; i < m; i++) {printf("output the first data in the queue:");dequeue_sq(&q, &e);printf("%c\n", e);}printf("traverse the queue now:");queuetraverse_sq(q, (*visit));printf("\nthe length of the queue is %d\n", queuelength_sq(&q));}