实现链表的基本函数

头文件(linklist.h)

#pragma once

#include <stdio.h>
#include <windows.h>
#include <stddef.h>
#include <assert.h>
typedef int listtype;
typedef struct linklist
{
	listtype data;
	struct linklist* next;
}Linklist,*listpoint;
 

void linklist_init(listpoint* headpoint);//初始化
void linklist_pushback(listpoint* pphead, listtype data);//尾插
listpoint new_listnode(listtype data);//开辟节点
void linklist_popback(listpoint* pphead);//尾删
void linklist_pushhead(listpoint* phead, listtype data);//头插
void destroy(listpoint head);//释放内存
void linklist_pophead(listpoint* head);//头删
void linklist_print(listpoint head);//打印链表
void linklist_insert(listpoint* head,size_t pos,listtype data);//任意位置插入
void linklist_pop(listpoint* head, size_t pos);//任意位置删除

实现函数(linklist.c)

#include "linklist.h"

void destroy(listpoint head)
{
	free(head);
}
	
listpoint new_listnode(listtype data)//建立新的节点
{
	listpoint newnode = (listpoint)malloc(sizeof(Linklist));
	assert(newnode);
	newnode->data = data;
	newnode->next = NULL;
	return newnode;
}

void linklist_print(listpoint head)//打印
{
	for (; head != NULL; head = head->next)
	{
		printf("%d ", head->data);
	}
}

void linklist_init(listpoint* headpoint)//初始化链表
{
	*headpoint = NULL;
}

void linklist_pushback(listpoint* pphead, listtype data)//尾插
{
	assert(pphead);
	if (*pphead == NULL)
	{
		*pphead = new_listnode(data);
	}
	else
	{
		listpoint tail = *pphead;
		while (tail->next != NULL)
		{
			tail = tail->next;
		}
		tail->next = new_listnode(data);
	}
}

void linklist_popback(listpoint* pphead)//尾删
{	
	assert(pphead);
	if (*pphead == NULL)
	{
		printf("尾删时链表为空\n");
		system("pause");
		exit(1);
	}
	if ((*pphead)->next == NULL)
	{
		destroy(*pphead);
		*pphead = NULL;
	}
	else
	{
		listpoint tmp = *pphead;
		while (tmp->next->next != NULL)
		{
			tmp = tmp ->next;
		}
		destroy(tmp->next);
		tmp->next = NULL;
	}
}
 
void linklist_pushhead(listpoint* phead, listtype data)//头插
{
	assert(phead);
	listpoint tmp = *phead;
	*phead = new_listnode(data);
	(*phead)->next = tmp;
}

void linklist_pophead(listpoint* head)//头删
{
	assert(head);
	if (*head == NULL)
	{
		printf("头删时链表为空\n");
		system("pause");
		exit(1);
	}
	listpoint tmp = (*head)->next;
	destroy(*head);
	*head = tmp;
}

void linklist_insert(listpoint* head,size_t pos,listtype data)//任意位置插入
{	
	size_t list_count = 0;
	size_t count = 0;
	listpoint tmp = *head;
	assert(head);
	while (tmp != NULL)
	{
		tmp = tmp->next;
		list_count++;
	}
	if (list_count == 0)
	{
		printf("任意位置插入时链表为空\n");
		system("pause");
		exit(1);
	}
	if (pos > list_count || pos == 0)
	{
		printf("任意位置插入时插入位置不合法\n");
		system("pause");
		exit(1);
	}
	if (pos == 1)
	{
		linklist_pushhead(head,data);
	}
	else
	{
		listpoint tmp1 = NULL;
		tmp = *head;
		for (; count < pos - 2; count++)
		{
			tmp = tmp->next;
		}
		tmp1 = tmp->next;
		tmp->next = new_listnode(data);
		tmp->next->next = tmp1;
	}
}

void linklist_pop(listpoint* head, size_t pos)//任意位置删除
{
	size_t count = 0;
	assert(head);
	if (*head == NULL)
	{
		printf("任意位置删除时链表为空，无法删除！");
		exit(1);
	}
	listpoint tmp = *head;
	while (tmp != NULL)
	{
		count++;
		tmp = tmp->next;
	}
	if (pos > count || pos == 0)
	{
		perror("任意位置删除时，位置不合法\n");
		exit(1);
	}
	if(pos == 1)
	{
		tmp = (*head)->next;
		destroy(*head);
		*head = tmp;
	}
	else
	{
		tmp = *head;
		pos -= 2;
		while (pos--)
		{
			tmp = tmp->next;
		}
		listpoint tmp1 = tmp->next->next;
		destroy(tmp->next);
		tmp->next = tmp1;
	}
}

测试函数(test.c)

#include "linklist.h"

int main()
{
	listpoint node;
	listpoint tmp = NULL;
	linklist_init(&node);//初始化
	linklist_pushback(&node, 5);//尾插
	linklist_pushback(&node, 5);//尾插
	linklist_pushback(&node, 6);//尾插
	linklist_popback(&node);//尾删
	linklist_popback(&node);//尾删
	linklist_pushhead(&node, 7);//头插
	linklist_pophead(&node);//头删
	linklist_insert(&node, 1, 9);//任意位置插入
	linklist_insert(&node, 2, 15);//任意位置插入
	linklist_insert(&node, 3, 20);//任意位置插入
	linklist_pop(&node, 1);//任意位置删除
	linklist_pop(&node, 2);//任意位置删除
	linklist_print(node);//打印
	free(node);
	system("pause");
	return 0;
}