双向链表 C语言实现

有头结点的双向链表如下图所示：

//双向不循环链表，有头结点

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#include<iostream>
using namespace std;

typedef int elemtype;
typedef struct DOUBLE_LIST
{
	elemtype data;
	struct DOUBLE_LIST *prev;
	struct DOUBLE_LIST *next;
}double_list;

//创建双向链表
double_list *creatlist()
{
	double_list *head, *p, *q;
	int n;
	elemtype x;
	head = (double_list*)malloc(sizeof(double_list));//先创建头结点
	head->next = NULL;
	head->prev = NULL;
	p = head;
	printf("输入要创建双向循环链表元素的个数：\n");
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		printf("输入元素为：\n");
		scanf("%d", &x);
		q = (double_list*)malloc(sizeof(double_list));
		q->data = x;
		q->prev = p;
		q->next = NULL;
		p->next = q;
		p = q;
		//尾插法
	}
	return head;
}

//显示双向链表
void dispaly(double_list *head)
{
	double_list *p;
	p = head;
	p = p->next;
	while (p != NULL)
	{
		printf("%d ", p->data);
		p = p->next;
	}
	printf("\n");
}

//获得双向链表中元素的个数
int length(double_list *head)
{
	double_list *p;
	p = head;
	int num = 0;
	while ((p->next) != NULL)
	{
		p = p->next;
		num++;
	}
	return num;
}

//在第i个元素之前插入数据
void insertelem(double_list *head, int i, elemtype elem)
{
	double_list *p = head;
	double_list *q = (double_list*)malloc(sizeof(double_list));
	q->data = elem;
	for (int j = 1; j < i; j++)
	{
		p = p->next;
		if (p == NULL && j < i)
		{
			printf("error \n");
		}
	}
	q->next = p->next;
	p->next->prev = q;
	p->next = q;
	q->prev = p;
}

//删除第i个元素的数据
void deletelem(double_list *head, int i, elemtype &elem)
{
	double_list *p = head;
	for (int j = 1; j < i; j++)
	{
		p = p->next;
		if (p->next == NULL && j < i)
		{
			printf("error \n");
		}
	}
	double_list *q = p->next;
	elem = q->data;
	(q->next)->prev = p;
	p->next = q->next;
	free(q);
}

//删除值为x的元素  
void deletelist_x(double_list *head, int x)
{
	double_list *p = head, *q;
	p = p->next;
	while (p != NULL)
	{
		if (p->data == x)
		{
			q = p->next;
			(p->prev)->next = p->next;
			(p->next)->prev = p->prev;
			free(p);
			p = q;
		}
		else
			p = p->next;
	}
}

int main()
{
	double_list *head;
	head = creatlist();//创建
	dispaly(head);
	int num;
	int i, j, x;
	elemtype elem;
	num = length(head);
	cout << "插入元素的位置：" << endl;
	cin >> i;
	cout << "插入的数据为：" << endl;
	cin >> elem;
	insertelem(head, i, elem);
	dispaly(head);
	cout << "删除元素的位置为：" << endl;
	cin >> j;
	deletelem(head, j, elem);
	dispaly(head);
	cout << "删除的数据为：" << endl;
	cin >> x;
	deletelist_x(head, x);
	dispaly(head);
	system("pause");
	return 0;
}