单链表接口的实现

SList.h
#ifndef __TEST_H__
#define __TEST_H__
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<malloc.h>

typedef int SLTDataType;
typedef struct SListNode
{
	SLTDataType _data;
	struct SListNode* _next;
}SListNode;

typedef struct SList
{
	SListNode* _head;
}SList;

void SListInit(SList* plist);//初始化链表
SListNode* BuySListNode(SLTDataType x);//向操作系统开辟一段空间
void SListPushFront(SList* plist, SLTDataType x);//头插
void SListPrint(SList* plist);//打印链表
void SListPushBack(SList* plist, SLTDataType x);//尾插
void SListPopFront(SList* plist);//头删
void SListPopBack(SList* plist);//尾删
SListNode* SListFind(SList* plist, SLTDataType x);//找给定数字的位置
void SListInsertAfter(SListNode* pos, SLTDataType x);//在某个位置插入一个值
void SListDestory(SList* plist);//释放链表
void SListEraseAfter(SListNode* pos);
void Test1();
#endif //__TEST_H__

SList.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"SList.h"
void SListInit(SList* plist)
{
	assert(plist);
	plist->_head = NULL;
}
SListNode* BuySListNode(SLTDataType x)
{
	SListNode* pnode = (SListNode*)malloc(sizeof(SListNode));
	pnode->_data = x;
	pnode->_next = NULL;
	return pnode;
}

void SListPushFront(SList* plist, SLTDataType x)
{
	assert(plist);
	SListNode* newhead = BuySListNode(x);
	newhead->_next = plist->_head;
	plist->_head = newhead;
}


void SListPushBack(SList* plist, SLTDataType x)
{
	assert(plist);
	if (plist->_head == NULL)
	{
		plist->_head = BuySListNode(x);
	}
	else
	{
		SListNode* tail = plist->_head;
		while (tail->_next != NULL)
		{
			tail = tail->_next;
		}
		SListNode* newtail = BuySListNode(x);
		tail->_next = newtail;
	}
}

void SListPopFront(SList* plist)
{
	assert(plist);
	SListNode* next = plist->_head->_next;
	free(plist->_head);
	 plist->_head=next;
}

void SListPopBack(SList* plist)
{
	assert(plist);
	if (plist->_head->_next == NULL)//只有一个结点
	{
		free(plist->_head);
		plist->_head = NULL;
	}
	else//有两个及以上的结点
	{
		SListNode* tail = plist->_head;
		SListNode* prev = NULL;
		while (tail->_next != NULL)
		{
			prev = tail;
			tail = tail->_next;
		}
		free(tail);
		prev->_next = NULL;
	}
}

SListNode* SListFind(SList* plist, SLTDataType x)
{
	assert(plist);
	SListNode* cur = plist->_head;
	while (cur != NULL)
	{
		if (cur->_data == x)
		{
			return cur;
		}
		cur = cur->_next;
	}
	return cur;
}

void SListInsertAfter(SListNode* pos, SLTDataType x)
{
	assert(pos);
	SListNode* newnode = BuySListNode(x);
	newnode->_next = pos->_next;
	pos->_next = newnode;
}


void SListPrint(SList* plist)
{
	assert(plist);
	SListNode* cur = plist->_head;
	while (cur != NULL)
	{
		printf("%d->", cur->_data);
		cur = cur->_next;
	}
	printf("NULL\n");
}

void SListEraseAfter(SListNode* pos)
{
	assert(pos && pos->_next);
	SListNode* next = pos->_next;
	SListNode* nextnext = next->_next;
	pos->_next = nextnext;
	free(next);
}



void SListDestory(SList* plist)
{
	assert(plist);
	SListNode* cur = plist->_head;
	if (cur != NULL)
	{
		SListNode* next = cur->_next;
		free(cur);
		cur = next;
	}
	plist->_head = NULL;
}

SList list;
void Test1()
{
	SListInit(&list);
	SListPushBack(&list, 4);
	SListPushBack(&list, 3);
	SListPushBack(&list, 2);
	SListPushBack(&list, 1);
	SListPrint(&list);
	SListPushFront(&list, 5);
	SListPrint(&list);
	SListPopFront(&list);
	SListPrint(&list);
	SListPopBack(&list);
	SListPrint(&list);
	SListNode* pos = SListFind(&list, 3);
	SListInsertAfter(pos, 30);
	SListPrint(&list);
	SListEraseAfter(pos);
	SListPrint(&list);
	SListDestory(&list);

}

test.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"SList.h"
int main()
{
	Test1();
	return 0;
}