C语言：单链表所有操作

1.结构体变量访问成员用
mylist.head（用点运算符访问，不用指向符，只有指针用指向符访问）

此两种访问方式相同
2.删除链表某个节点

bool Erase_Item(LinkList* plist, int pos)
{
	assert(plist != nullptr);
	ListNode* pre = FindPos_Pre(plist, pos);
	if (pre == nullptr || pre->next == nullptr) return false;
	ListNode* q = pre->next;
	pre->next = q->next;
	free(q);
	q = nullptr;
	plist->cursize -= 1;
	return true;
}

提高代码复用程度，代码功能单一
3.

4.

#include<stdio.h>//printf scanf
#include<string.h>
#include<stdlib.h>//malloc free exit
#include<assert.h>//assert

typedef int ElemType;
typedef struct ListNode
{
	ElemType data;
	struct ListNode* next;
}ListNode;

typedef struct LinkList
{
	struct ListNode* head;
	int cursize;
}LinkList;

ListNode* Buynode()//购买节点
{
	ListNode* s = (ListNode*)malloc(sizeof(ListNode));
	if (nullptr == s)exit(1);
	memset(s, 0, sizeof(ListNode));
	return s;
}
void Freenode(ListNode* p)
{
	free(p);
}
void Init_List(LinkList* plist)//初始化当前链表节点
{
	assert(plist != nullptr);
	plist->head = Buynode();
	plist->cursize = 0;
}
int GetSize(LinkList* plist)//获得当前列表节点个数（不包括头节点）
{
	assert(plist != nullptr);
	return plist->cursize;
}
bool Is_Empty(LinkList* plist)//是否为空
{
	return GetSize(plist) == 0;
	return plist->cursize == 0;
}
ListNode* FindValue(LinkList* plist, ElemType val)
{
	assert(plist != nullptr);
	ListNode* p = plist->head->next;
	while (p != nullptr && p->data != val)
	{
		p = p->next;
	}
	return p;
}
ListNode* FindValue_Pre(LinkList* plist, ElemType val)//双指针
{
	assert(plist != nullptr);
	ListNode* pre = plist->head;//head
	ListNode* p = plist->head->next;//first data
	while (p != nullptr && p->data != val)
	{
		pre = p;
		p = p->next;
	}
	if (p == nullptr)
	{
		pre = nullptr;
	}
	return pre;
}
ListNode* FindValue_Pre2(LinkList* plist, ElemType val)//单指针
{
	assert(plist != nullptr);
	ListNode* pre = plist->head;
	while (pre->next != nullptr && pre->next->data != val)
	{
		pre = pre->next;
	}
	if (pre->next == nullptr)
	{
		pre = nullptr;
	}
	return pre;
}
void Print_List(LinkList list)//打印函数（无指针，8字节，占用空间较大）
{
	ListNode* p = list.head->next;
	while (p != nullptr)
	{
		printf("%5d", p->data);
		p = p->next;
	}
	printf("\n");
}
void Print_List(LinkList* plist)//打印函数（指针，4字节）
{
	assert(plist != nullptr);
	ListNode* p = plist->head->next;
	while (p != nullptr)
	{
		printf("%5d", p->data);
		p = p->next;
	}
	printf("\n");
}
ListNode* FindPos(LinkList* plist, int pos)//按照位置查询
{
	assert(plist != nullptr);
	if (pos < 1 || pos > plist->cursize + 1)return nullptr;
	ListNode* p = plist->head;
	int i = 1;
	while (i < pos)
	{
		p = p->next;
		++i;
	}
	return p;
}
ListNode* FindPos_Pre(LinkList* plist, int pos)//查询前驱节点
{
	assert(plist != nullptr);
	if (pos<1 || pos>plist->cursize + 1) return nullptr;
	ListNode* p = plist->head;
	int i = 1;
	while (i < pos)
	{
		p = p->next;
		++i;
	}
	return p;
}
void Insert(LinkList* plist, ListNode* pre,ElemType val)//
{
	assert(plist != nullptr);
	ListNode* s = Buynode();
	s->data = val;
	s->next = pre->next;
	pre->next = s;
	plist->cursize += 1;
}
bool Insert_Item(LinkList* plist, int pos, ElemType val)
{
	assert(plist != nullptr);
	ListNode* p = FindPos_Pre(plist, pos);
	if (p != nullptr)
	{
		Insert(plist, p,val);
	}
	return true;
}
void push_back(LinkList* plist, ElemType val)//尾部插入
{
	Insert_Item(plist, plist->cursize + 1, val);
}
void push_front(LinkList* plist, ElemType val)//头部插入
{
	Insert_Item(plist, 1, val);
}
void Insert_Ar(LinkList* plist, int pos, ElemType* ar, int n)//初始化一个数组
{
	for (int i = 0; i < n; ++i)
	{
		Insert_Item(plist, pos, ar[i]);
	}
}
void Insert_Val(LinkList* plist, int pos, ElemType val, int n)//初始化n个相同的数据
{
	for (int i = 0; i < n; ++i)
	{
		Insert_Item(plist, pos, val);
	}
}
bool Erase_Next(LinkList* plist, ListNode* pre)//删除某一个节点
{
	assert(plist != nullptr);
	if (pre != nullptr && pre->next != nullptr)
	{
		ListNode* q = pre->next;
		pre->next = q->next;
		Freenode(q);
		plist->cursize -= 1;
	}
}
bool Erase_Pos(LinkList* plist, int pos)//删除pos位置的节点,按照位置删除
{
	assert(plist != nullptr);
	bool res = false;
	ListNode* pre = FindPos_Pre(plist, pos);
	if (pre != nullptr)
	{
		Erase_Next(plist, pre);
		res = true;
	}
	return res;
}
void pop_back(LinkList*plist)//删除尾部元素
{
	Erase_Pos(plist, plist->cursize);
}
void pop_front(LinkList* plist)//删除第一个元素
{
	Erase_Pos(plist, 1);
}
void remove(LinkList* plist, ElemType val)//按照数值来删除，删除和value相同的数值
{
	ListNode* p = FindValue_Pre(plist, val);//找到当前数值前驱
	Erase_Next(plist, p);//删除前驱后一个，即当前数值
}
void Clear_List(LinkList* plist)//
{
	assert(plist != nullptr);
	while (plist->head->next != nullptr)
	{
		Erase_Next(plist, plist->head);
	}
}
void Destroy_List(LinkList*plist)
{
	assert(plist != nullptr);
	Clear_List(plist);
	Freenode(plist->head);
	plist->head = nullptr;
}
void remove_all(LinkList* plist, ElemType val)//和value相同的节点全部删除
{
	assert(plist != nullptr);
	ListNode* p = plist->head;
	while (p->next != nullptr)
	{
		if (p->next->data == val)
		{
			Erase_Next(plist, p);
		}
		else
		{
			p = p->next;
		}
	}
}

int main()
{
	LinkList mylist;//局部变量（随机值）
	Init_List(&mylist);
	Insert_Val(&mylist, 1, 23, 10);
	Print_List(&mylist);

	return 0;
}