文档介绍：//循环队列练****
#include<>
#include<>
#include<>
void init_queue(struct queue *ps , int len );//初始化函数
int empty_queue(struct queue *ps); //判断队列是否为空
int full_queue(struct queue *ps, int len); //判断队列是否为满
void en_queue(struct queue *ps, int val, int len);//入队
void out_queue(struct queue *ps, int len); //出队
void traverse_queue(struct queue *ps, int len); //显示队
void clear_queue(struct queue *ps); //清空队
struct queue
{int *pbase;
int front;
int rear;
};
//主函数
int main(void)
{
int len;
int val;
struct queue s;
printf("请输入想申请的静态队列空间大小:");
scanf("%d",&len);
printf("初始化中..................\n");
init_queue(&s,len);
printf("初始化完毕！\n");
//入列测试
printf("请输入入队信息！\n");
scanf("%d",&val);
en_queue(&s, val, len);
scanf("%d",&val);
en_queue(&s, val, len);
scanf("%d",&val);
en_queue(&s, val, len);
scanf("%d",&val);
en_queue(&s, val, len);
scanf("%d",&val);
en_queue(&s, val, len);
//显示测试
printf("显示全部内容！\n");
traverse_queue(&s, len);
//出列测试
printf("出列！\n");
out_queue(&s, len);
printf("显示全部内容！\n");
traverse_queue(&s, len);
printf("出列！\n");
out_queue(&s, len);
printf("显示全部内容！\n");
traverse_queue(&s, len);
//清空测试
printf("清空！\n");
clear_queue(&s);
printf("显示全部内容！\n");
traverse_queue(&s, len);
return 0;
}
//初始化函数
void init_q