#include <stdio.h>
#include <malloc.h>
typedef struct qNode
{
char data;
struct qNode *next;
}qNode, *queuePtr;
typedef struct
{
queuePtr front;
queuePtr rear;
}linkQueue;
void initQueue(linkQueue *q)
{
q->front = q->rear = (queuePtr)malloc(sizeof(qNode));
if(!q->front) return;
q->front->next = NULL;
}
void enqueue(linkQueue *q, char e)
{
queuePtr p = (queuePtr)malloc(sizeof(qNode));
if(!p) return;
if(!q->front) return;
p->data = e;
p->next = NULL;
q->rear->next = p;
q->rear = p;
}
void dequeue(linkQueue *q, char *e)
{
queuePtr p;
if(q->front == q->rear) return;
p = q->front->next;
*e = p->data;
q->front->next = p->next;
if(q->rear == p)
{
q->rear = q->front;
}
free(p);
}
void destroyQueue(linkQueue *q)
{
while (q->front)
{
q->rear = q->front->next;
free(q->front);
q->front = q->rear;
}
}
void main()
{
char elem;
linkQueue queue;
initQueue(&queue);
printf("请输入一段话,以@结束。\n");
scanf("%c", &elem);
while (elem != '@')
{
enqueue(&queue, elem);
scanf("%c", &elem);
}
printf("请把@符号之前的话输出:\n");
//这里的判断条件不能写成while(elem),否则会无线循环下去的
while (queue.front != queue.rear)
{
dequeue(&queue, &elem);
printf("%c", elem);
}
printf("\n");
destroyQueue(&queue);
}
妙趣横生的算法实例1-5
最新推荐文章于 2019-03-23 00:06:33 发布