基于 Linux 的双链表的增删改查代码

/*************************************************************************
  > File Name: doublelinklist.c
  > Author: Wenfei6316
  > Mail: Wenfei6316@163.com 
  > Created Time: 2018年06月16日 星期六 23时36分30秒
 ************************************************************************/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

#define LEN 25

typedef int data_t;
typedef struct DulNode
{
	data_t data;
	struct DulNode *prior;
	struct DulNode *next;
}DulNode, *DuLinkList;

DuLinkList CreateEmptyList(void);
DuLinkList CreateList(DuLinkList linklist, int len);
void PrintList(DuLinkList linklist);
void ListInsert(DuLinkList linklist, int posi, int value);
void ListDelete(DuLinkList linklist, int posi, int *value);
void ListReverse(DuLinkList linklist);
void ClearList(DuLinkList linklist);

int main(int argc, const char *argv[])
{
	int posi = 5;
	data_t data = 113;
	DuLinkList head, dulinklist;
	head = CreateEmptyList();
	dulinklist = CreateList(head, LEN);
	PrintList(dulinklist);

	printf("插入第 %d 位置，数据为 %d\n", posi, data);
	ListInsert(dulinklist, posi-1, data);
	PrintList(dulinklist);

	ListDelete(dulinklist, posi, &data);
	printf("删除第 %d 位置，数据为 %d\n", posi-1, data);
	PrintList(dulinklist);

	ListReverse(dulinklist);
	PrintList(dulinklist);

	ClearList(dulinklist);

	return 0;
}

//创建一个空表，即头节点
DuLinkList CreateEmptyList(void)
{
	DuLinkList head;
	head = (DuLinkList)malloc(sizeof(DulNode));
	if (head == NULL)
	{
		perror("Create head failed");
		exit(EXIT_FAILURE);
	}

	head->data = -1;
	head->prior = NULL;
	head->next = NULL;

	return head;
}

//尾插法创建链表
DuLinkList CreateList(DuLinkList linklist, int len)
{
	int i;
	DuLinkList p, q;
	if (linklist == NULL)
	{
		printf("Head linklist error!\n");
		return NULL;
	}

	srand(time(NULL));
	p = linklist;
	for (i=0; i<len; i++)
	{
		q = (DuLinkList)malloc(sizeof(DulNode));
		if (q == NULL)
		{
			perror("Create linklist failed!\n");
			exit(EXIT_FAILURE);
		}

		q->data = rand() % 100;
		q->prior = p;
		p->next = q;
		p = q;
	}

	p->next = NULL;

	return linklist;
}

//遍历链表
void PrintList(DuLinkList linklist)
{
	DuLinkList p;
	int count = 0;
	if (linklist == NULL || linklist->next == NULL)
	{
		printf("Linklist is error!\n");
		return;
	}

	p = linklist->next;
	while (p != NULL)
	{
		printf("%3d  ", p->data);
		p = p->next;
		if (!(++count % 5))
			printf("\n");
	}
	if (count % 5)
		printf("\n");
}

//插入新节点
void ListInsert(DuLinkList linklist, int posi, int value)
{
	int i;
	DuLinkList p, q;
	if (linklist == NULL)
	{
		printf("Linklist error\n");
		return ;
	}

	p = linklist;
	for (i=0; i<posi-1 && p; i++)
		p = p->next;
	if (p == NULL || posi <= 0)
	{
		printf("Position error!\n");
		return ;
	}

	q = (DuLinkList)malloc(sizeof(DulNode));
	if (q == NULL)
	{
		perror("Insert failed");
		return ;
	}
	q->data = value;
	q->next = p->next;
	q->prior = p;
	if (p->next != NULL)
		p->next->prior = q;
	p->next = q;

}

//删除第 posi 位置节点
void ListDelete(DuLinkList linklist, int posi, int *value)
{
	int i;
	DuLinkList p;
	if (linklist == NULL || posi <= 0)
	{
		printf("Linklist error!\n");
		return ;
	}

	p = linklist;
	for (i=0; i<posi && p; i++)
		p = p->next;
	if (p == NULL)
	{
		printf("Position error!\n");
		return ;
	}

	p
	if (p->next == NULL)
	{
		p->prior->next = NULL;
		return ;
	}
	p->prior->next = p->next;
	p->next->prior = p->prior;

	free(p);
	p = NULL
}

//双链表反序
void ListReverse(DuLinkList linklist)
{
	DuLinkList p, q;
	if (linklist == NULL)
	{
		printf("Linklist error!\n");
		return ;
	}

	if (linklist->next == NULL)
	{
		printf("Linklist is empty!\n");
		return ;
	}

	p = linklist->next->next;
	linklist->next->next = NULL;

	while (p != NULL)
	{
		q = p;
		p = p->next;
		q->next = linklist->next;
		linklist->next->prior = q;
		linklist->next = q;
		q->prior = linklist;
	}

	return ;
}

//清除链表，但不清楚链表头
void ClearList(DuLinkList linklist)
{
	DuLinkList p, q;
	if (linklist == NULL)
	{
		printf("Linklist error!\n");
		return ;
	}

	p = linklist->next;
	linklist->next = NULL;
	while (p != NULL)
	{
		q = p;
		p = p->next;
		free(q);
	}
	printf("Clear linklist OK!\n");

	return ;
}