单链表

最新推荐文章于 2024-10-06 12:03:03 发布

原创最新推荐文章于 2024-10-06 12:03:03 发布 · 138 阅读

CC 4.0 BY-SA版权

本文详细介绍了单链表的基本操作，包括节点创建、初始化、插入、删除、查找等，并提供了完整的C语言实现代码。通过一系列的测试用例，展示了如何构建、修改和销毁单链表。

单链表
SingleList.h
#pragma once
typedef int Type;
typedef struct Node {
Node* next;
Type val;
}Node;
typedef struct List {
Node* head;
}List;
Node* CreatNode(Type val);
void ListInit(List* list);
void ListPushBack(List* list, Type val);
void ListPopBack(List* list);
void ListPushFront(List* list, Type val);
void ListPopFront(List* list);
void ListInsertNodeAfter(List* list,Node* node,Type val);
void ListEraseAfter(Node* node);
Node* ListFind(List* list, Type val);
void DestyList(List* list);
void PrintfList(List* Node);
SingleList.cpp
#include"singleList.h"
#include<stdio.h>
#include<stdlib.h>
Node* CreatNode(Type val)
{
Node* node = (Node*)malloc(sizeof(Node));
node->val = val;
node->next = NULL;
return node;
}
void ListInit(List* list)
{
list->head = NULL;
}
void ListPushBack(List* list, Type val)
{
Node* node = CreatNode(val);
Node* head = list->head;
if (head == NULL)
{
list->head = node;
return;
}
while (head->next)
{
head = head->next;
}
head->next = node;
}
void ListPopBack(List* list)
{
Node* head = list->head;
if (head == NULL)
return;
if (head->next == NULL)
{
list->head = NULL;
return;
}
while (head->next->next)
{
head = head->next;
}
free(head->next);
head->next = NULL;
}
void ListPushFront(List* list, Type val)
{
Node* node = CreatNode(val);
Node* head = list->head;
if (head == NULL)
{
list->head = node;
return;
}
node->next = list->head;
list->head = node;
}
void ListPopFront(List* list)
{
if(list->head == NULL)
return;
Node* tmp = list->head;
list->head = list->head->next;
free(tmp);
}
void ListInsertNodeAfter(List* list,Node* node, Type val)
{
if (node == list->head&&list->head==NULL)
{
ListPushFront(list,val);
return;
}
if (node == NULL)
{
return;
}
Node* newnode = CreatNode(val);
newnode->next = node->next;
node->next = newnode;
}
void ListEraseAfter(Node* node)
{
if (node == NULL)
return;
if (node->next == NULL)
return;
Node* tmp = node->next;
node->next = node->next->next;
free(tmp);
}
Node* ListFind(List* list, Type val)
{
Node* head = list->head;
if (head == NULL)
return NULL;
while (head)
{
if (head->val == val)
return head;
head = head->next;
}
return NULL;
}
void DestyList(List* list)
{
Node* head = list->head;
Node* next = NULL;
while (head)
{
next = head->next;
free(head);
head = next;
}
list->head = NULL;
printf(“链表已经销毁\n”);
}
void PrintfList(List* list)
{
Node* head = list->head;
while (head)
{
printf("%d “, head->val);
head = head->next;
}
printf(”\n");
}
test.cpp
#include<stdio.h>
#include<stdlib.h>
#include"singleList.h"
void test()
{
List list;
ListInit(&list);
ListPushBack(&list, 1);
PrintfList(&list);
ListPushBack(&list, 2);
PrintfList(&list);
ListPushBack(&list, 3);
PrintfList(&list);
ListPushBack(&list, 4);
PrintfList(&list);
ListPushBack(&list, 5);
PrintfList(&list);
printf("\n");

ListPopBack(&list);
PrintfList(&list);
ListPopBack(&list);
PrintfList(&list);
ListPopBack(&list);
PrintfList(&list);
ListPopBack(&list);
PrintfList(&list);
ListPopBack(&list);
PrintfList(&list);
ListPopBack(&list);
PrintfList(&list);



ListPushFront(&list, 1);
PrintfList(&list);
ListPushFront(&list, 2);
PrintfList(&list);
ListPushFront(&list, 3);
PrintfList(&list);
ListPushFront(&list, 4);
PrintfList(&list);
ListPushFront(&list, 5);
PrintfList(&list);



ListPopFront(&list); 
PrintfList(&list);
ListPopFront(&list);
PrintfList(&list);
ListPopFront(&list);
PrintfList(&list);
ListPopFront(&list);
PrintfList(&list);
ListPopFront(&list);
PrintfList(&list);
ListPopFront(&list);
PrintfList(&list);



Node* node = list.head;
ListInsertNodeAfter(&list,node, 1);
PrintfList(&list);
node = list.head;
ListInsertNodeAfter(&list, node, 2);
PrintfList(&list);
node = list.head;
ListInsertNodeAfter(&list, node, 3);
PrintfList(&list);
node = list.head;
ListInsertNodeAfter(&list, node, 4);
PrintfList(&list);
node = list.head;
ListInsertNodeAfter(&list, node, 5);
PrintfList(&list);
node = list.head->next;
ListInsertNodeAfter(&list, node, 6);
PrintfList(&list);

}
int main()
{
test();
return 0;
}