奶茶加盟 技术支持 东莞网站建设整合营销的特点有哪些

用C语言实现队列的初始化、队列的判空操作、入队操作、出队运算、取队头元素运算、顺序打印队列。

#include<stdio.h>
#define QueueSize 100
typedef char ElemType;
typedef struct//队列结构体
{ElemType data[QueueSize];//保存队中元素int front, rear;//队头和队尾指针
} SqQueue;
//队列的初始化
void InitQueue(SqQueue*qu)
{qu->rear = qu->front;//指针初始化
}
//队列的判空操作
int QueueEmpty(SqQueue*qu)//判断队空运算
{if (qu->front ==qu->rear)//队空{return 1;}else{return 0;}
}
//入队操作
int EnQueue(SqQueue*qu, ElemType x)
{if ((qu->rear + 1) % QueueSize == qu->front) //表示队列已经满了{return 0;}qu->rear = (qu->rear + 1) % QueueSize; //队尾指针进1qu->data[qu->rear] = x;return 1;
}
//出队运算
int DeQueue(SqQueue*qu, ElemType*x)
{if (QueueEmpty(qu)){return 0;}*x = qu->data[qu->front];qu->front = (qu->front + 1) % QueueSize;//队头指针进1return 1;
}
//取队头元素运算
int GetHead(SqQueue*qu, ElemType*x)
{if (qu->rear == qu->front)//队空{return 0;}*x = qu->data[(qu->front + 1) % QueueSize];{return 1;}
}
//顺序打印队列
void printQueue(SqQueue* qu)
{for (int i = qu->front; i != qu->rear; i = (i + 1) % QueueSize){printf("%c", qu->data[i+1]);}printf("\n");
}
void main()
{SqQueue qu;ElemType e;InitQueue(&qu);printf("队%s\n", (QueueEmpty(&qu) == 1 ? "空" : "不空"));printf("a进队\n");EnQueue(&qu,'a');printf("b进队\n");EnQueue(&qu,'b');printf("c进队\n");EnQueue(&qu,'c');printf("d进队\n");EnQueue(&qu,'d');printf("打印队列中的元素：");printQueue(&qu);printf("队%s\n", (QueueEmpty(&qu) == 1 ? "空" : "不空"));GetHead(&qu,&e);printf("队头元素:%c\n",e);printf("出队次序:");printQueue(&qu);printf("\n");
}

运行结果：