【链式队列】

思路

创建

入队

出队

释放

清除

程序

linkqueue.h

#pragma once
typedef int datatype;

typedef struct node {
	datatype data;
	struct node *next;
}listnode, *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.h

#include <stdio.h>
#include <stdlib.h> 
#include <string.h>
#include "linkqueue.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(listnode));
	if (lq->front == NULL) {
		printf("malloc node failed\n");
		return NULL;
	}
	lq->front->data = 0;
	lq->front->next = NULL;

	return lq;
	return NULL;
}

int enqueue(linkqueue * lq, datatype x)
{
	linklist p;

	if (lq == NULL) {
		printf("lq is NULL\n");
		return -1;
	}

	p=(linklist)malloc(sizeof(listnode));
	if (p == NULL) {
		return -1;
	}
	p->data = x;
	p->next = NULL;

	lq->rear->next = p;
	lq->rear = p;
	return 0;
}

datatype dequeue(linkqueue * lq)
{
	linklist p;
	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 != NULL) {
		p = lq->front;
		lq->front = p->next;
		printf("clear:%d\n", p->data);
		free(p);
		p = NULL;
	}
	return 0;
}

linkqueue * queue_free(linkqueue * lq)
{
	linklist p;

	if (lq == NULL) {
		printf("lq is NULL\n");
		return NULL;
	}
	
	while (lq->front!=NULL){
		p = lq->front;
		lq->front = p->next;
		printf("free:%d\n", p->data);
		free(p);
		p = NULL;
	}
	free(lq);
	lq = NULL;
	return NULL;
}

test.c

#include <stdio.h>
#include "linkqueue.h"

int  main()
{
	linkqueue *lq;

	lq = queue_create();
	if (lq == NULL)
		return -1;

	enqueue(lq, 10);
	enqueue(lq, 20);
	enqueue(lq, 30);
	enqueue(lq, 40);

	while (!queue_empty(lq)) {
		printf("dequeue:%d\n", dequeue(lq));
	}
	//queue_clear(lq);

	lq = queue_free(lq);

	system("pause");
	return 0;
}