【数据结构】单链表 -- 无头单项链表

无头单项链表分为2个源文件，一个头文件，增删查，没有改，改可以在查直接改，增加有头点尾增加和头点尾删除；

test.c:

#include "SList.h"

void Test1()
{
	SLTNode* plist = NULL;
	SLTPrint(plist);
	SLTPushFront(&plist, 1);
	SLTPrint(plist);
	SLTPushFront(&plist, 2);
	SLTPrint(plist);
	SLTPushFront(&plist, 3);
	SLTPrint(plist);
	SLTPushFront(&plist, 4);
	SLTPrint(plist);
	SLTPopFront(&plist);
	SLTPrint(plist);
	SLTPopFront(&plist);
	SLTPrint(plist);
	SLTPopBack(&plist);
	SLTPrint(plist);
	SLTPushBack(&plist, 5);
	SLTPrint(plist);
	SLTPushBack(&plist, 6);
	SLTPrint(plist);

}

void Test2()
{
	SLTNode* plist = NULL;
	SLTNode* pos = NULL;
	SLTPushFront(&plist, 3);
	SLTPrint(plist);

	pos = SLTFind(plist, 3);
	SLTInsert(pos, 30);
	SLTPrint(plist);
	SLTInsertAfter(&plist, pos, 10);
	SLTPrint(plist);
	pos = SLTFind(plist, 30);
	SLTInsertAfter(&plist, pos, 20);
	SLTPrint(plist);

}
 
void Test3()
{
	SLTNode* plist = NULL;
	SLTNode* pos = NULL;
	SLTPushFront(&plist, 3);
	SLTPrint(plist);
	pos = SLTFind(plist, 3);
	SLTInsert(pos, 30);
	SLTPrint(plist);
	pos = SLTFind(plist, 30);
	SListErase(&plist, pos);
	SLTPrint(plist);

}

void Test4()
{
	SLTNode* plist = NULL;
	SLTPrint(plist);
	SLTPushFront(&plist, 1);
	SLTPrint(plist);
	SLTPushFront(&plist, 2);
	SLTPrint(plist);
	SLTPushFront(&plist, 3);
	SLTPrint(plist);
	SLTPushFront(&plist, 4);
	SLTPrint(plist);

	SListDestory(&plist);
	SLTPrint(plist);

}

int main()
{

	//Test1();
	//Test2();
	//Test3();
	Test4();

	return 0;
}

SList.h:

#pragma once

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

typedef int SLTDateType;

typedef struct SLTNode
{
	SLTDateType date;
	struct SLTNode* next;
}SLTNode;

extern void SLTPushBack(SLTNode** pplist, SLTDateType x);		//尾插
extern void SLTPushFront(SLTNode** pplist, SLTDateType x);		//头插
extern void SLTPopBack(SLTNode** pplist);						//尾删
extern void SLTPopFront(SLTNode** pplist);						//头删
extern SLTNode* SLTFind(SLTNode* plist, SLTDateType x);			//查找
extern void SLTPrint(SLTNode* plist);							//打印
extern void SLTInsertAfter(SLTNode** pplist, SLTNode* pos, SLTDateType x);//找到前插入
extern void SLTInsert(SLTNode* pos, SLTDateType x);				//找到插入
extern void SListDestory(SLTNode** pplist);						//链表删除
extern void SListEraseAfter(SLTNode* pos);						//pos后一个删除
extern void SListErase(SLTNode** pplist, SLTNode* pos);			//pos删除

SList.c:

#include "SList.h"

static SLTNode* BuySLTNode(SLTDateType x)
{
	SLTNode* new = (SLTNode*)malloc(sizeof(SLTNode));
	if (new == NULL)
		return;
	new->date = x;
	new->next = NULL;

	return new;
}

//打印
void SLTPrint(SLTNode* plist)
{
	SLTNode* end = plist;
	while (end != NULL)
	{
		printf("%d", end->date);
		end = end->next;
		printf("->");
	}
	printf("NULL\n");
}

//尾插
void SLTPushBack(SLTNode** pplist, SLTDateType x)
{
	SLTNode* new = BuySLTNode(x);
	//1、空
	//2、非空
	if (*pplist == NULL)
	{
		*pplist = new;
	}
	else
	{
		SLTNode* end = *pplist;
		while (end->next != NULL)
		{
			end = end->next;
		}
		end->next = new;
	}
}

//头插
void SLTPushFront(SLTNode** pplist, SLTDateType x)
{
	SLTNode* new = BuySLTNode(x);
	new->next = *pplist;
	*pplist = new;
}

//尾删
void SLTPopBack(SLTNode** pplist)
{
	//1、0个节点
	if (*pplist == NULL)
		return;
	//2、1个节点
	else if ((*pplist)->next == NULL)
	{
		free(*pplist);
		*pplist = NULL;
	}
	//3、多个节点
	else
	{
		SLTNode* end = *pplist;
		SLTNode* front = NULL;
		while (end->next != NULL)
		{
			front = end;
			end = end->next;
		}
		free(end);
		end = NULL;
		front->next = NULL;
	}

}

//头删
void SLTPopFront(SLTNode** pplist)
{
	//1个
	if (*pplist == NULL)
		return;
	//3个
	else
	{
		SLTNode* end = (*pplist)->next;
		free(*pplist);
		*pplist = end;
	}

}

//查找节点
SLTNode* SLTFind(SLTNode* plist, SLTDateType x)
{
	SLTNode* find = plist;

	while (find != NULL)
	{
		//1
		if (find->date == x)
		{
			return find;
		}
		find = find->next;
	}
	printf("没有找到\n");
	return NULL;
}

//找到插入
void SLTInsert(SLTNode* pos, SLTDateType x)
{
	assert(pos);

	SLTNode* new = BuySLTNode(x);
	new->next = pos->next;
	pos->next = new;
}

//pos前一个加
void SLTInsertAfter(SLTNode** pplist, SLTNode* pos, SLTDateType x)
{
	assert(pos);
	SLTNode* new = BuySLTNode(x);
	SLTNode* front = NULL;
	SLTNode* end = *pplist;

	if (end == pos)
	{
		new->next = pos;
		*pplist = new;
	}
	else
	{
		while (end != pos)
		{
			front = end;
			end = end->next;
		}
		new->next = front->next;
		front->next =new;
	}

}

//pos后·减
void SListEraseAfter(SLTNode* pos)
{
	assert(pos);
	if (pos->next == NULL)
		return;
	else
	{
		SLTNode* end = pos->next;
		pos->next = end->next;
		free(end);
		end = NULL;
	}

}

//pos位删除
void SListErase(SLTNode** pplist, SLTNode* pos)
{
	assert(pos);

	if (*pplist == pos)
	{
		SLTNode* end = pos->next;
		*pplist = end;
		free(pos);
		pos = NULL;
	}
	else
	{
		SLTNode* front = *pplist;
		while (front->next != pos)
		{
			front = front->next;
		}
		front->next = pos->next;
		free(pos);
		pos = NULL;
	}

}

//整个删
void SListDestory(SLTNode** pplist)
{
	assert(*pplist);
	
	while ((*pplist)->next != NULL)
	{
		SLTNode* end = (*pplist)->next;
		free(*pplist);
		*pplist = end;
	}
	free(*pplist);
	*pplist = NULL;
}