一、运行结果
二、代码
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#define MAX 7
/**
*@Name:线性表--队列--循环队列顺序表示
*@Description:循环队列的创建,元素的入队、出队、取队头元素,队列假溢出的判断等基本操作。
*@Author:Freedoman
*@Date: 2014-8-9
*/
struct SeqCirQueue //循环队列类型
{
int head; /*队头*/
int tail; /*队尾*/
int elements[MAX]; /*队列元素集*/
};
typedef struct SeqCirQueue * PSeqCirQueue;
/*函数声明*/
PSeqCirQueue createNullSeqCirQueue();
int isNullSeqCirQueue(PSeqCirQueue curSeqCirQueue);
int isFullSeqCirQueue(PSeqCirQueue curSeqCirQueue);
int enQueue(PSeqCirQueue curSeqCirQueue);
int deQueue(PSeqCirQueue curSeqCirQueue);
int loadQueueHeadElement(PSeqCirQueue curSeqCirQueue);
void printSeqCirQueue(PSeqCirQueue curSeqCirQueue);
/*---------创建一个固定容量的空循环队列------------*/
PSeqCirQueue createNullSeqCirQueue(){
printf("创建一个固定容量的空循环队列\n");
PSeqCirQueue curSeqCirQueue = (PSeqCirQueue)malloc(sizeof(struct SeqCirQueue));
if(curSeqCirQueue != NULL){
curSeqCirQueue->head = 0;
curSeqCirQueue->tail = 0;
printf("创建成功!\n");
}else{
printf("创建失败!\n");
free(curSeqCirQueue);
}
return curSeqCirQueue;
}
/*----------判断一个循环队列是否为空------------*/
int isNullSeqCirQueue(PSeqCirQueue curSeqCirQueue){
if(curSeqCirQueue->head == curSeqCirQueue->tail ){
printf("空队列!\n");
return 1;
} else {
printf("非空队列!\n");
return 0;
}
}
/*---判断一个循环队列是否为满(防止假溢出,从逻辑上把elements看成一个环)--*/
int isFullSeqCirQueue(PSeqCirQueue curSeqCirQueue){
if((curSeqCirQueue->tail+1) % MAX == curSeqCirQueue->head){
printf("循环队列满!\n");
return 1;
} else {
printf("循环队列未满!\n");
return 0;
}
}
/*-----------元素入队(限定在队尾操作)-----------*/
int enQueue(PSeqCirQueue curSeqCirQueue){
printf("元素入队\n");
int data;
// 入队可能上溢
if(!isFullSeqCirQueue(curSeqCirQueue)){
printf("请输入元素>>>");
scanf("%d",&data);
curSeqCirQueue->elements[curSeqCirQueue->tail] = data;
/循环队列的重点,逻辑环
curSeqCirQueue->tail = (curSeqCirQueue->tail+ 1)%MAX;
printf("入队成功!\n");
printSeqCirQueue(curSeqCirQueue);
return 1;
}else{
printf("上溢!\n");
return 0;
}
}
/*--------元素出队(限定在队头操作)---------*/
int deQueue(PSeqCirQueue curSeqCirQueue){
printf("元素出队\n");
// 出队可能下溢
if(!isNullSeqCirQueue(curSeqCirQueue)){
curSeqCirQueue->head = (curSeqCirQueue->head + 1)%MAX;
printf("出队成功!\n");
printSeqCirQueue(curSeqCirQueue);
return 1;
}else{
printf("下溢!\n");
return 0;
}
}
/*--------------取队头元素(队列本身保持不变)---------------*/
int loadQueueHeadElement(PSeqCirQueue curSeqCirQueue){
printf("取队头元素\n");
int x;
if(!isNullSeqCirQueue(curSeqCirQueue)){
x = curSeqCirQueue->elements[curSeqCirQueue->head];
printf("队头元素>>>>%d\n",x);
return x;
}
return -1;
}
/*------从头至尾打印当前队列元素-----*/
void printSeqCirQueue(PSeqCirQueue curSeqCirQueue){
int i;
printf("打印[");
// 判断是否形成逻辑环
if(curSeqCirQueue->head < curSeqCirQueue->tail){
for(i=curSeqCirQueue->head; i< curSeqCirQueue->tail; i++){
printf(" %d ",curSeqCirQueue->elements[i]);
}
}else{
for(i = curSeqCirQueue->head; i < MAX; i++){
printf(" %d ",curSeqCirQueue->elements[i]);
}
for(i = 0; i < (curSeqCirQueue->tail)&MAX; i++){
printf(" %d ",curSeqCirQueue->elements[i]);
}
}
printf("]\n");
}
int main(){
int input;
PSeqCirQueue curSeqCirQueue = NULL;
printf("\n------循环队列的基本操作------\n");
while(1){
printf("\n 1_创建一个指定容量的空循环队列\n 2_判断当前队列是否为空\n 3_判断当前队列是否为空\n");
printf(" 4_元素入队\n 5_元素出队\n 6_取栈队头元素\n 7_从头至尾打印当前队列元素\n");
printf("\n请选择>>>");
scanf("%d",&input);
switch(input){
case 1 : curSeqCirQueue = createNullSeqCirQueue();break;
case 2 : isNullSeqCirQueue(curSeqCirQueue);break;
case 3 : isFullSeqCirQueue(curSeqCirQueue);break;
case 4 : enQueue(curSeqCirQueue);break;
case 5 : deQueue(curSeqCirQueue);break;
case 6 : loadQueueHeadElement(curSeqCirQueue);break;
case 7 : printSeqCirQueue(curSeqCirQueue);break;
default : printf("当前输入有误!\n");
}
}
return 0;
}