数据结构：单链表的实现

1.SList.h文件

#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>//定义链表（结点）的结构typedef int SLTDateType;typedef struct SListNode {int data;struct SListNode* next;
}SLTNode;//链表的打印
void SLTPrint(SLTNode* Phead);//尾插
void SLTPushBack(SLTNode** PPhead, SLTDateType x);
//头插
void SLTPushFront(SLTNode** PPhead, SLTDateType x);
//尾删
void SLTPopBack(SLTNode** PPhead);
//头删
void SLTPopFront(SLTNode** PPhead);
//查找
SLTNode* SLTFind(SLTNode* Phead, SLTDateType x);
//在指定位置之前插入数据
void SLTInsert(SLTNode** PPhead, SLTNode* pos, SLTDateType x);
//删除pos结点
void SLTErase(SLTNode** PPhead, SLTNode* pos);
//在指定位置之后插入数据
void SLTInsertAfter(SLTNode* pos, SLTDateType x);
//删除pos之后的结点
void SLTEraseAfter(SLTNode* pos);
//销毁链表
void SListDestory(SLTNode** PPhead);

2. 1.SList.c文件

#include "SList.h"//申请新结点
SLTNode* SLTBuyNode(SLTDateType x)
{SLTNode* node = (SLTNode*)malloc(sizeof(SLTNode));if (node == NULL){perror("malloc fail!");exit(1);}node->data = x;node->next = NULL;
}//尾插
void SLTPushBack(SLTNode** PPhead, SLTDateType x)
{assert(PPhead);SLTNode*newnode=SLTBuyNode(x);if(*PPhead==NULL){*PPhead = newnode;}else{//尾节点- ->新节点SLTNode* pcur = *PPhead;while (pcur->next){pcur = pcur->next;}pcur->next = newnode;}
}
//头插
void SLTPushFront(SLTNode** PPhead, SLTDateType x)
{assert(PPhead);//申请一个新结点SLTNode* newnode = SLTBuyNode(x);//让新结点的next指向都结点newnode->next = *PPhead;*PPhead = newnode;
}
//尾删
void SLTPopBack(SLTNode** PPhead) 
{//链表为空，不能删除assert(PPhead && *PPhead);//只有一个结点if ((*PPhead)->next == NULL){free(*PPhead);*PPhead = NULL;}else{//找尾结点SLTNode* ptail = *PPhead;SLTNode* prev = NULL;while (ptail->next){prev = ptail;ptail = ptail->next;}prev->next = NULL;free(ptail);ptail = NULL;}
}//头删
void SLTPopFront(SLTNode** PPhead)
{//链表为空，不能删除assert(PPhead && *PPhead);SLTNode* next = (*PPhead)->next;free(*PPhead);*PPhead = next;
}
//查找
SLTNode* SLTFind(SLTNode* Phead, SLTDateType x)
{assert(Phead);SLTNode* pcur = Phead;while (pcur){if (pcur->data == x){return pcur;}pcur = pcur->next;}//没有找到return NULL;
}//在指定位置之前插入数据
void SLTInsert(SLTNode** PPhead, SLTNode* pos, SLTDateType x)
{assert(pos);assert(PPhead);//申请一个新的结点SLTNode* newnode = SLTBuyNode(x);SLTNode* prev = *PPhead;if (pos == *PPhead){SLTPushFront(PPhead, x);}else{while (prev->next != pos){prev = prev->next;}//prev newnode pos newnode->next = pos;prev->next = newnode;}
}//在指定位置之后插入数据
void SLTInsertAfter(SLTNode* pos, SLTDateType x)
{assert(pos);SLTNode* newnode = SLTBuyNode(x);//pos newnode pos->nextnewnode->next = pos->next;pos->next = newnode;
}//删除pos结点
void SLTErase(SLTNode** PPhead, SLTNode* pos)
{assert(pos);assert(PPhead && *PPhead);//头删除if (pos == *PPhead){SLTPopFront(PPhead);}else{SLTNode* prev = *PPhead;while (prev->next != pos){prev = prev->next;}//prev pos pos->nextprev->next = pos->next;free(pos);pos = NULL;}
}//删除pos之后的结点
void SLTEraseAfter(SLTNode* pos)
{assert(pos && pos->next);//pos pos->next pox->next->nextSLTNode* del = pos->next;pos->next = pos->next->next;free(del);del = NULL;
}//销毁链表
void SListDestory(SLTNode** PPhead)
{assert(PPhead && *PPhead);SLTNode* pcur = *PPhead;while (pcur){SLTNode* next = pcur->next;free(pcur);pcur = next;}*PPhead = NULL;
}//链表的打印
void SLTPrint(SLTNode* phead)
{SLTNode* pcur = phead;while (pcur){printf("%d->", pcur->data);pcur = pcur->next;}printf("NULL\n");
}

 3.test.c文件

#include "SList.h"
//创建一个链表，并且打印列表//void createSlist()
//{
//	//链表示有一个一个结点组成
//	SLTNode* node1 = (SLTNode*)malloc(sizeof(SLTNode));
//	node1->data = 1;
//
//	SLTNode* node2 = (SLTNode*)malloc(sizeof(SLTNode));
//	node2->data = 2;
//
//	SLTNode* node3 = (SLTNode*)malloc(sizeof(SLTNode));
//	node3->data = 3;
//
//	SLTNode* node4 = (SLTNode*)malloc(sizeof(SLTNode));
//	node4->data = 4;
//
//	node1->next = node2;
//	node2->next = node3;
//	node3->next = node4;
//	node4->next = NULL;
// 
//	SLTPrint(node1);
//}void SListTest01()
{SLTNode* pList = NULL;/*SLTPushBack(&pList, 1);SLTPrint(pList);SLTPushBack(&pList, 2);SLTPushBack(&pList, 3);*/SLTPushFront(&pList,1);SLTPushFront(&pList,2);SLTPushFront(&pList,3);SLTPushFront(&pList,4);SLTPrint(pList);/*SLTPopBack(&pList);*///头删除//SLTPopFront(&pList);//查找SLTNode* find=SLTFind(pList, 4);
//	if (find == NULL){printf("没有找到！\n");}
//	else{printf("找到了！\n");}在指定位置之前插入数据//SLTInsert(&pList, find, 11);//SLTPrint(pList);//在指定位置之后插入数据//SLTInsertAfter(find, 11); //4->3->2->1->11->NULL/*SLTPrint(pList);*///删除指定位置的结点
//	SLTNode* find = SLTFind(pList, 1);//SLTErase(&pList, find);//SLTPrint(pList);//4->3->2->NULL//SLTErase(&pList, find, 1);//SLTPrint(pList);删除pos之后的结点
//	SLTEraseAfter(find);
//	SLTPrint(pList);销毁链表SListDestory(&pList);SLTPrint(pList);
}
int main()
{//createSlist();SListTest01();return 0;
}