C语言单向链表最全功能实现

目录

一、功能

二、结果

三、代码

---

一、功能

Node* initLinkedList(int value);//创建一个链表
Node* appendNode(Node* head, int value);//在链表结尾附加一个结点
int findNode(Node* head, int value);//查找元素
void printAllNodes(Node* head);//打印链表
Node* insertNode(Node* head, int count, int value);//插入一个结点
int getLength(Node* head);//获取链表长度
void deleteAtTail(Node* head);//删除尾结点
void deleteNode(Node* head, int targetValue);//删除目标结点
Node* reverseList(Node* head);//逆转链表

二、结果

三、代码

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

typedef struct Node
{
	int data;
	struct Node* next;
}Node;

Node* initLinkedList(int value);//创建一个链表
Node* appendNode(Node* head, int value);//在链表结尾附加一个结点
int findNode(Node* head, int value);//查找元素
void printAllNodes(Node* head);//打印链表
Node* insertNode(Node* head, int count, int value);//插入一个结点
int getLength(Node* head);//获取链表长度
void deleteAtTail(Node* head);//删除尾结点
void deleteNode(Node* head, int targetValue);//删除目标结点
Node* reverseList(Node* head);//逆转链表

int main(void)
{
	Node* head = initLinkedList(20);
	printAllNodes(head);
	appendNode(head, 28);
	appendNode(head, 67);
	printAllNodes(head);
	findNode(head, 20);
	insertNode(head, 1, 2);
	printAllNodes(head);
	getLength(head);
	deleteAtTail(head);
	printAllNodes(head);
	appendNode(head, 89);
	appendNode(head, 77);
	printAllNodes(head);
	deleteNode(head, 28);
	printAllNodes(head);
	Node* reversedHead = reverseList(head);
	printAllNodes(reversedHead);
	return 0;
}

//创建一个链表
Node* initLinkedList(int value)
{
	//malloc的返回值是void*，指向分配的内存的首地址
	Node* head = (Node*)malloc(sizeof(Node));
	if (NULL == head)
	{
		printf("Memory allocation failed\n");
		exit(1);//内存分配失败，程序直接退出，返回状态码1
	}

	head->data = value;
	head->next = NULL;

	printf("initial head sucess:%d\n", value);
	return head;
}

//在链表结尾附加一个结点
Node* appendNode(Node* head, int value)
{
	Node* newNode = (Node*)malloc(sizeof(Node));
	if (NULL == newNode)
	{
		printf("Memory allocation failed!\n");
		exit(1);
	}

	newNode->data = value;
	newNode->next = NULL;

	if (NULL == head)
	{
		return newNode;
	}

	while (NULL != head->next)
	{
		head = head->next;
	}
	head->next = newNode;
	printf("append node sucess:%d\n", value);
	return newNode;
}

//查找元素
int findNode(Node* head, int value)
{
	if (NULL == head)
	{
		return -1;
	}

	int count = 0;
	while (head->data != value)
	{
		++count;
		if (NULL == head->next)
		{
			printf("not found:%d\n", value);
			return -1;

		}
		head = head->next;
		printf("find value index:%d\n", value);
	}

	return count;
}

//打印链表
void printAllNodes(Node* head)
{
	if (NULL == head)
	{
		return;
	}
	printf("list:");
	while (NULL != head)
	{
		printf("%d ", head->data);
		head = head->next;
		if (NULL != head)
		{
			printf("-> ");
		}
	}
	printf("\n");
	return;
}

//插入一个结点
Node* insertNode(Node* head, int count, int value)
{
	Node* newNode = (Node*)malloc(sizeof(Node));
	if (NULL == newNode)
	{
		printf("Memory allocation failed\n");
		exit(1);
	}

	newNode->data = value;
	newNode->next = NULL;

	for (int i = 0; i < count - 1; ++i)
	{
		head = head->next;
	}

	newNode->next = head->next;
	head->next = newNode;

	printf("insert %d at %d sucess\n", value, count);
	return newNode;

}

//获取链表长度
int getLength(Node* head)
{
	int count = 1;
	while (NULL != head->next)
	{
		head = head->next;
		++count;

	}
	printf("length:%d\n", count);

	return count;
}

//删除尾结点
void deleteAtTail(Node* head)
{
	if (NULL == head)
	{
		printf("list is empty\n");
		return;
	}
	Node* last = NULL;
	while (NULL != head->next)
	{
		last = head;
		head = head->next;
	}
	last->next = NULL;

	printf("delete at tail sucess\n");
}

//删除目标结点
void deleteNode(Node* head, int targetValue)
{
	if (NULL == head)
	{
		printf("wrong\n");
		return;
	}
	Node* last = NULL;
	while (head->data != targetValue)
	{
		last = head;
		if (head->next == NULL)
		{
			printf("not found:%d\n", targetValue);
			return;
		}
		head = head->next;
	}
	last->next = head->next;
	printf("delete %d sucess\n", targetValue);
}

//逆转链表
Node* reverseList(Node* head)
{
	Node* last = NULL;
	Node* next = NULL;
	while (NULL != head)
	{
		next = head->next;
		head->next = last;
		last = head;
		head = next;
	}
	printf("reverse sucess\n");

	return last;
}