数据结构单链表的实现（C语言）

1.实现的接口和功能

//打印链表
void SLTPrint(SLTNode** phead);
//头插
void PushFont(SLTNode** phead, SLTDataType x);
//尾插
void PushBack(SLTNode** phead, SLTDataType x);
//头删
void PopFont(SLTNode** phead);
//尾删
void PopBack(SLTNode** phead);
//删除链表
void Destory(SLTNode** phead);
//创建一个结点
SLTNode* Create(SLTDataType x);
//查找x的结点
SLTNode* Find(SLTNode** phead,SLTDataType x);
//查找指定结点并删除
void FindDele(SLTNode** phead, SLTDataType x);
//删除指定结点的下一个结点
void Delenext(SLTNode** phead, SLTDataType* pos);
//删除指定结点的上一个结点
void DeleAfter(SLTNode** phead, SLTDataType* pos);

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

2.代码块

声明代码:

#include
#include
#include
typedef int SLTDataType;
typedef struct SListNode
{
	SLTDataType data;
	struct SListNode* next;
}SLTNode;
//打印链表
void SLTPrint(SLTNode** phead);
//头插
void PushFont(SLTNode** phead, SLTDataType x);
//尾插
void PushBack(SLTNode** phead, SLTDataType x);
//头删
void PopFont(SLTNode** phead);
//尾删
void PopBack(SLTNode** phead);
//删除链表
void Destory(SLTNode** phead);
//创建一个结点
SLTNode* Create(SLTDataType x);
//查找x的结点
SLTNode* Find(SLTNode** phead,SLTDataType x);
//查找指定结点并删除
void FindDele(SLTNode** phead, SLTDataType x);
//删除指定结点的下一个结点
void Delenext(SLTNode** phead, SLTDataType* pos);
//删除指定结点的上一个结点
void DeleAfter(SLTNode** phead, SLTDataType* pos);

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

实现代码：

#include"SList.h"
SLTNode* Create(SLTDataType x)
{
	SLTNode* list = (SLTNode*)malloc(sizeof(SLTNode));
	if (list == NULL)
	{
		perror("malloc fail\n");
	}
	list->next = NULL;
	list->data = x;
	return list;
}
void SLTPrint(SLTNode** phead)
{
	assert(*phead);
	SLTNode* list = *phead;
	while (list)
	{
		printf("%d ", list->data);
		list = list->next;
	}
	printf("\n");
}
void PushFont(SLTNode** phead, SLTDataType x)
{
	SLTNode* p = Create(x);
	if (*phead == NULL)
	{
		*phead = p;
	}
	else
	{
		p->next = *phead;
		*phead = p;
	}

}
void PushBack(SLTNode** phead, SLTDataType x)
{
	SLTNode* p = Create(x);
	if (*phead == NULL)
	{
		*phead = p;
    }
	SLTNode* prev = NULL;
	SLTNode* ps = *phead;
	while (ps)
	{
		prev = ps;
		ps = ps->next;
	}
	prev->next = p;

}
void PopFont(SLTNode** phead)
{
	assert(*phead);
	SLTNode* p = (*phead)->next;
	free(*phead);
	*phead = p;
}
void PopBack(SLTNode** phead)
{
	assert(*phead);
	if ((*phead)->next == NULL)
	{
		free(*phead);
		*phead = NULL;
	}
	SLTNode* p = *phead;
	SLTNode* prev = NULL;
	while (p->next)
	{
		prev = p;
		p = p->next;
	}
	free(p);
	prev->next = NULL;
}
SLTNode* Find(SLTNode** phead, SLTDataType x)
{
	assert(*phead);
	SLTNode* p = *phead;
	while (p->data!=x)
	{
		p = p->next;
	}
	if (p->data == x)
		return p;
	else
		return NULL;
}
void FindDele(SLTNode** phead, SLTDataType x)
{
	assert(*phead);
	SLTNode* p = *phead; 
	SLTNode* prev = NULL;
	while (p!=NULL&&p->data!=x)
	{  
		prev = p;
		p = p->next;
	}
	if (p->data == x)
	{
		prev->next = p->next;
		free(p);
	}

}
void Destory(SLTNode** phead)
{
	assert(*phead);
	SLTNode* later = NULL;
	SLTNode *p= *phead;
	while (p)
	{
		later = p->next;
		free(p);
		p = later;
	}
}
void Delenext(SLTNode** phead, SLTDataType* pos)
{
	assert(phead);
	SLTNode* p = *phead;
	while (p != pos)
	{
		p = p->next;
	}
	if (p->next == NULL)
	{
		return;
	}
	SLTNode* ps = p->next;
	p->next = p->next->next;
	free(ps);
}
void DeleAfter(SLTNode** phead, SLTDataType* pos)
{
	assert(phead);
	assert(&phead);
	if ((*phead)->next == NULL)
	{
		return;
	}
	SLTNode* p = *phead;
	SLTNode* prev = NULL;
	while (p->next!= pos)
	{
		prev = p;
		p = p->next;
	}
	if (prev == NULL)
	{
		*phead = p->next;
		return;
	}
	prev->next = p->next;
	free(p);
}
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160

测试用例代码:

#include"SList.h"
int main()
{
	SLTNode* list = NULL;
	PushFont(&list,1);
	PushFont(&list, 2);
	PushFont(&list, 3);
	PushBack(&list,4);
	PushBack(&list, 5);
	PushBack(&list, 6);
	SLTPrint(&list);
    PopFont(&list);
	PopBack(&list);
	SLTPrint(&list);
	FindDele(&list, 5);
	SLTNode*p= Find(&list,4);
	SLTNode* ps = Find(&list, 1);
	Delenext(&list,p);
	SLTPrint(&list);
     DeleAfter(&list, ps);
	SLTPrint(&list);
	Destory(&list);
	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

结尾：今天的分享到此结束，喜欢的朋友如果感觉有帮助可以点赞三连支持，咱们共同进步!