栈和队列--队列

 一、顺序队列

SeqQueue.h

/* Name: SeqQueue.h Version: 0.10 Author: dir Date: 15-06-09 15:26 Description:*/#ifndef __SEQQUEUE__H__#define __SEQQUEUE__H__#include <stdlib.h>#include <stdio.h>#define MaxSize 100typedef char DataType;typedef struct{DataType data[MaxSize];int front, rear;}SQueue;// 队列初始化void InitQueue(SQueue *sq){sq->rear = sq->front = 0;}// 入队列int EnQueue(SQueue *sq, DataType x){if((sq->rear + 1) % MaxSize == sq->front){printf("Queue is full!/n");return 0;}sq->rear = (sq->rear + 1) % MaxSize;sq->data[sq->rear] = x;return 1;}// 判断队空int Empty(SQueue *sq){return (sq->rear == sq->front) ? 1 : 0;}// 出队列int OutQueue(SQueue *sq, DataType *x){if(Empty(sq)){printf("Queue is empty!/n");return 0;}sq->front = (sq->front + 1) % MaxSize;*x = sq->data[sq->front];return 1;}// 取队头元素int GetHead(SQueue *sq, DataType *x){if(Empty(sq)){printf("Queue is empty!/n");return 0;}*x = sq->data[(sq->front + 1) % MaxSize];return 1;}#endif

SeqQueue.c

/* Name: SeqQueue.c Version: 0.10 Author: dir Date: 15-06-09 15:30 Description:*/#include "SeqQueue.h"int main(){DataType x;SQueue sq;InitQueue(&sq);printf("input char to insert queue, EOF to exit/n");while((x = getchar()) != EOF){EnQueue(&sq, x);}while(!Empty(&sq)){OutQueue(&sq, &x);printf("%c ", x);}system("pause");return 0;}

 

运行截图:

 

二、链队列

LinkedQueue.h

/* Name: LinkedQueue.h Version: 0.10 Author: dir Date: 15-06-09 17:14 Description:*/#ifndef __LINKEDQUEUE__H__#define __LINKEDQUEUE__H__#include <stdlib.h>#include <stdio.h>// 这里为了例子的实现DataType给出的是一个结构体// 如果需要可以改成你想要的类型typedef struct{char name[20];char sex; //性别，'F'表示女性，'M'表示男性}Person;typedef Person DataType; //将队列中元素的数据类型改为Person// 链队结点类型typedef struct qnode{DataType data;struct qnode *next;}QType;// 链队指针类型typedef struct qptr{QType *front, *rear;}SQueue;SQueue lq;// 初始化链队void InitQueue(SQueue *lq){QType *p;p = (QType *)malloc(sizeof(QType));p->next = NULL;lq->front = lq->rear = p;}// 入队列int EnQueue(SQueue *lq, DataType x){QType *s;s = (QType *)malloc(sizeof(QType));s->data = x;s->next = lq->rear->next;lq->rear->next = s;lq->rear = s;return 1;}// 判断队空int Empty(SQueue *lq){return (lq->front == lq->rear ? 1 : 0);}// 出队列int OutQueue(SQueue *lq, DataType *x){QType *p;// 先判断队空if(Empty(lq)){printf("Queue is empty!/n");return 0;}p = lq->front->next;*x = p->data;lq->front->next = p->next;// 若原队列中只有一个结点，删除后队列变空if(lq->front->next == NULL)lq->rear = lq->front;free(p);return 1;}// 取队头元素int GetHead(SQueue *lq, DataType *x){if(Empty(lq)){printf("Queue is empty!/n");return 0;}*x = lq->front->next->data;return 1;}// 获得队列长int GetLen(SQueue *lq){int len = 0;QType *p;p = lq->front->next;while (lq->front->next != NULL){len++;lq->front->next = lq->front->next->next;}lq->front->next = p;return len;}#endif

LinkedQueue.c

/* Name: LinkedQueue.c Version: 0.10 Author: dir Date: 15-06-09 17:14 Description:*/#include "LinkedQueue.h"#include <string.h>// 假设在周末舞会上，男士们和女士们进入舞厅时，各自排成一队。// 跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。// 若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。// 现要求写一算法模拟上述舞伴配对问题。// 这里数据保存在dancer.dat文件中，格式如下：// M 张三// F 李四// ...// 舞者配对void DancerPartner(){int pos;FILE *fp;Person p;SQueue mdancer, fdancer;InitQueue(&mdancer);InitQueue(&fdancer);// 打开文件if( (fp = fopen("dancer.dat", "r")) == NULL ){printf("Can not open file!/n");exit(1);}// 读入舞者数据while(!feof(fp)){p.sex = fgetc(fp); // 性别fgetc(fp); // 清除空格fgets(p.name, 20, fp); // 姓名// 去掉姓名中的回车，此回车是通过fgets读入的pos = strlen(p.name);if (p.name[pos-1] == '/n'){p.name[pos-1] = '/0';}if(p.sex == 'F')EnQueue(&fdancer, p); // 插入女队elseEnQueue(&mdancer, p); // 插入男队}// 输出舞者配对信息printf("The dancing partners are:/n");while(!Empty(&fdancer) && !Empty(&mdancer)){OutQueue(&fdancer, &p);printf("%s/n", p.name);OutQueue(&mdancer, &p);printf("%s/n", p.name);}// 输出剩余人员信息if(!Empty(&fdancer)){printf("There are %d women waitin for the next round./n", GetLen(&fdancer));GetHead(&fdancer, &p);printf("%s will be the first to get a partner./n", p.name);}else if(!Empty(&mdancer)){printf("There are %d men waitin for the next round./n", GetLen(&mdancer));GetHead(&mdancer, &p);printf("%s will be the first to get a partner./n", p.name);}elseprintf("Pairing complete/n");}int main(){DancerPartner();system("pause");return 0;}

dancer.dat内容如下:

M 男一F 女一M 男二M 男三F 女二M 男四F 女三F 女四M 男五F 女五F 女六

 

运行截图:

 

说明：

1. 链队列中为了结合例子给出的DataType类型是一个结构体的类型

   这里可以改成你需要的类型
2. 通过fgets读入的字符串会包括结尾的回车部分。这里通过strlen-1得到'/0'的前一位置，如果这个字符是'/n'刚换成'/0'来消除回车符。