问题描述:链式队列功能实现:输入数字入队,输入字符出队。
代码实现:
实现一个功能函数需要三个文件(三个文件在同一目录)。
sequeue.h(定义顺序表)
sequeue.c(实现接口函数)
test.c(主函数实现)
linkqueue.h
typedef int datatype;
typedef struct node {
datatype data;
struct node *next;
} linknode, *linklist;
typedef struct {
linklist front;
linklist rear;
} linkqueue;
linkqueue *queue_create();
int enqueue(linkqueue *lq, datatype x);
datatype dequeue(linkqueue *lq);
int queue_empty(linkqueue *lq);
int queue_clear(linkqueue *lq);
linkqueue *queue_free(linkqueue *lq);
linkqueue.c
#include "linkqueue.h"
#include <stdio.h>
#include <stdlib.h>
linkqueue *queue_create() {
linkqueue *lq;
if ((lq = (linkqueue *) malloc(sizeof(linkqueue))) == NULL) {
printf("malloc linkqueue failed\n");
return NULL;
}
lq->front = lq->rear = (linklist) malloc(sizeof(linknode));
if (lq->front == NULL) {
printf("malloc node failed\n");
return NULL;
}
lq->front->data = 0;
lq->front->next = NULL;
return lq;
}
int enqueue(linkqueue *lq, datatype x) {
linklist p;
if (lq == NULL) {
printf("lq is NULL\n");
return -1;
}
if ((p = (linklist) malloc(sizeof(linknode))) == NULL) {
printf("malloc node failed\n");
return -1;
}
p->data = x;
p->next = NULL;
lq->rear->next = p;
lq->rear = p;
return 0;
}
datatype dequeue(linkqueue *lq) {
linklist p;
if (lq == NULL) {
printf("lq is NULL\n");
return -1;
}
p = lq->front;
lq->front = p->next;
free(p);
p = NULL;
return (lq->front->data);
}
int queue_empty(linkqueue *lq) {
if (lq == NULL) {
printf("lq is NULL\n");
return -1;
}
return (lq->front == lq->rear ? 1 : 0);
}
int queue_clear(linkqueue *lq) {
linklist p;
if (lq == NULL) {
printf("lq is NULL\n");
return -1;
}
while (lq->front->next) {
p = lq->front;
lq->front = p->next;
printf("free:%d\n", p->data);
free(p);
p = NULL;
}
}
linkqueue *queue_free(linkqueue *lq) {
linklist p;
if (lq == NULL) {
printf("lq is NULL\n");
return NULL;
}
while (lq->front) {
p = lq->front;
lq->front = p->next;
printf("free:%d\n", p->data);
free(p);
}
free(lq);
lq = NULL;
return NULL;
}
test.c
#include <stdio.h>
#include "linkqueue.h"
int main(int argc, const char *argv[])
{
linkqueue *lq;
int value;
lq = queue_create();
if(lq == NULL){
return -1;
}
printf("nums join,char out queue:\n");
printf("input:");
while(scanf("%d",&value)){
enqueue(lq,value);
printf("input:");
}
while(!queue_empty(lq)){
printf("%d\n",dequeue(lq));
}
queue_free(lq);
return 0;
}
运行结果:
由上述结果可知,输入10 20 30 正常入队,输入r则停止入队,并打印出队。