菜单2-1
菜单2-1-3-1
菜单2-1-3-1-4-1
菜单2-1-3-1-4-1-5-1
LinkList.h
#pragma once
typedef int Data;
typedef struct Node
{
Data data; //数据域
struct Node* next; //指针域,指向后继节点
//Node* next; //使用的Node是别名,此时还没有Node这个别名,所以不能使用
}Node;
typedef Node LinkList; //给Node取个别名
//创建链表,返回链表的头指针
LinkList* createLinkList();
//打印所有数据
void printAll(LinkList*list);
//头插
void push_front(LinkList*list,Data val);
//尾插
void push_back(LinkList* list,Data val);
//中间插:插入到指定的位置
void insert(LinkList* list,Data val,int pos);
//移除
void removeOne(LinkList* list, Data val);
//销毁链表
void destroyLinkList(LinkList** list);
LinkList.c
#include"LinkList.h"
#include<malloc.h>
LinkList* createLinkList()
{
//创建头节点
Node* head = calloc(1, sizeof(Node));
if (!head)
return NULL;
return head;
}
void printAll(LinkList* list)
{
Node* curNode = list->next;
while (curNode)
{
printf("%d ", curNode->data);
curNode = curNode->next;
}
}
void push_front(LinkList* list, Data val)
{
//来一个新节点
Node* newNode = calloc(1, sizeof(Node));
if (!newNode)
{
return;
}
//赋值数据
newNode->data = val;
//连接
//1,newNode连上后继节点
newNode->next = list->next;
//2,前驱节点连上newNode
list->next = newNode;
}
void push_back(LinkList* list, Data val)
{
Node* curNode = list; //让curNode指向头节点
//找到最后一个节点
while (curNode->next)
{
curNode = curNode->next;
}
//来一个新节点
Node* newNode = calloc(1, sizeof(Node));
if (!newNode)
return;
newNode->data = val;
//连接
curNode->next = newNode;
}
void insert(LinkList* list, Data val, int pos)
{
Node* prevNode = list; //辅助指针,用来保存前一个节点
//判断pos是否合法
for (int i = 0; i < pos; i++)
{
//如果找到NULL还没有找到pos就直接退出
if (prevNode == NULL)
{
printf("插入的位置无效\n");
return;
}
prevNode = prevNode->next;
}
Node* newNode = calloc(1, sizeof(Node));
if (!newNode)
return;
newNode->data = val;
//1,
newNode->next = prevNode->next;
//2,
prevNode->next = newNode;
}
void removeOne(LinkList* list, Data val)
{
Node* curNode = list; //指向头节点还是首元节点,根据需求分析
while (curNode->next)
{
if (curNode->next->data == val)
{
break;
}
curNode = curNode->next;
}
//要删除的节点是哪个?
Node* delNode = curNode->next;
//要删除的节点存在才能删除
if (delNode != NULL)
{
//让要删除的节点的前驱节点指向后继节点
curNode->next = delNode->next;
//释放节点
free(delNode);
}
}
void destroyLinkList(LinkList** list)
{
Node* curNode = *list; //当前节点
Node* prevNode = NULL; //指向前驱节点
while (curNode)
{
prevNode = curNode; //先保存
curNode = curNode->next; //再移动
free(prevNode); //释放前一个
}
*list = NULL; //在这能改变实参的值嘛?
//list是指针,在函数里面修改指针的指向,需要传指针的地址,即二级指针
}
main.c
#include<stdio.h>
#include"LinkList.h"
#include<stdbool.h>
enum
{
PrintAll = 1,
Push_Back,
Push_Front,
Insert,
RemoveOne,
Quit
};
int menu()
{
printf("************************\n");
printf("* 1,printAll 2,push_back*\n");
printf("* 3,push_front 4,insert *\n");
printf("* 5,removeOne 6,QUIT *\n");
printf("*******************\n");
int op = -1;
printf("input>");
int ret = scanf_s("%d", &op);
if (ret == 0)
{
getchar();
}
return op;
}
int main()
{
LinkList* list = createLinkList();
bool isDone = false;
while (!isDone)
{
int op = menu();
switch (op)
{
case PrintAll:
printAll(list);
break;
case Push_Back:
for (size_t i = 0; i < 5; i++)
{
push_back(list, i);
}
break;
case Push_Front:
for (size_t i = 0; i < 5; i++)
{
push_front(list, i);
}
break;
case Insert: // 0 1 2 3 4
insert(list, 66,5);
break;
case RemoveOne:
removeOne(list, 8);
break;
case Quit:
isDone = true;
break;
default:
break;
}
system("pause");
system("cls");
}
destroyLinkList(&list);
printf("程序结束,链表销毁成功");
printAll(list);
return 0;
}