【c语言双向链表练习】_创建一个双向链表的程序设计题

c语言双向链表练习

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

typedef struct Node
{
	int data;
	struct Node *pNext;
	struct Node *Pre;
}pNode,*ListNode;

//创建结点
struct Node *Create_Node(int dat)
{
	struct Node *pHead = (struct Node *)malloc(sizeof(pHead));
	//判断是否空间申请成功
	if(NULL == pHead)
	{
		return NULL;  //申请失败
	}
	//先清空间
	memset(pHead,'\0',sizeof(pHead));
	//赋值
	pHead->data = dat;
	pHead->pNext = NULL;
	pHead->Pre = NULL;
	//返回结点
	return pHead;
}


//头插法添加结点
struct Node *InsertNodeByHead(ListNode pHead,ListNode New)
{
	if(NULL == pHead || NULL == New)
	{
		return NULL;
	}
	New->pNext = pHead->pNext;
	if(NULL != pHead->pNext) //头结点下一个结点不是NULL
	{
		pHead->pNext->Pre = New;
	}
	New->Pre = pHead;
	pHead->pNext = New;
	return pHead;
}

//尾插法添加结点
struct Node *InsertNodeByTail(ListNode pHead,ListNode New)
{
	struct Node *Temp = pHead;
	while(NULL != Temp->pNext)
	{
		Temp = Temp->pNext;
	}
	New->pNext = Temp->pNext;
	New->Pre = Temp;
	Temp->pNext = New;
	return Temp;
}

//根据数据查找某个结点
struct Node *FindNodeByData(ListNode pHead,int dat)
{
	struct Node *Temp = pHead;
	while(NULL != Temp->pNext)
	{
		Temp = Temp->pNext;
		if(Temp->data == dat)
		{
			return Temp;  //找到数据
		}
	}
	return NULL; //循环完还没有找到
}
//删除结点
int DeleteNodeByData(ListNode pHead,int dat)
{
	struct Node *Temp = FindNodeByData(pHead,dat);
	if(NULL == Temp)
	{
		return 0;
	}
	
	//进行删除
	Temp->Pre->pNext = Temp->pNext;
	if(NULL != Temp->pNext)  //判断该结点的下一个是否为空
	{
		Temp->pNext->Pre = Temp->Pre;
	}
	free(Temp);
	return 1;	
}

void PrintNode(ListNode pHead)
{
	struct Node *Temp = pHead;
	int num = 1;
	while(NULL != Temp->pNext)
	{
		Temp = Temp->pNext;
		printf("node %d:%d\n",num,Temp->data);
		num++;
	}
}


int main(void)
{
	ListNode pH = NULL;
	pH = Create_Node(0);
	InsertNodeByHead(pH,Create_Node(12));
	InsertNodeByHead(pH,Create_Node(3));
	InsertNodeByHead(pH,Create_Node(45));
	InsertNodeByTail(pH,Create_Node(23));
	InsertNodeByTail(pH,Create_Node(5));
	InsertNodeByTail(pH,Create_Node(67));
	PrintNode(pH);
	printf("--------------删除结点后------------\n");
	DeleteNodeByData(pH,67);
	PrintNode(pH);
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124

运行结果
1