无头单链表的基本操作

SList.h

#ifndef _SLIST_H_
#define _SLIST_H_

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#include<assert.h>
#pragma warning(disable:4996)

typedef int DataType;
typedef struct SListNode
{
	struct SListNode* next;
	DataType data;
}SList, *pSList;


void SListInit(pSList* pHead);
pSList CreatNode(DataType data);
void SListPushFront(pSList* pHead, DataType data);
void  SListpushBack(pSList* pHead, DataType data);
void SListPopFront(pSList* pHead);
void SListPopBack(pSList* pHead);
pSList SListFind(pSList pHead, DataType data);
void SListInsert(pSList* pHead, int pos, DataType data);
void SListDestroy(pSList* pHead);
int SListSize(pSList pHead);
void SListRemoveAll(pSList *pHead, DataType data);
void SListErase(pSList* pHead, pSList pos);
void SlistBubbleSort(pSList *pHead);
void ShowSList(pSList pHead);
void removeElements(pSList head, int val);
#endif  //_SLIST_H_

SList.c

#include"SList.h"



// 不带头节点的单链表 
void SListInit(pSList* pHead)
{
	assert(pHead);
	*pHead = NULL;
}
//创建节点
pSList CreatNode( DataType data)
{
	pSList sl = (pSList)malloc(sizeof(SList));
	if (sl == NULL)
	{
		printf("内存申请失败！\n");
		return NULL;
	}
	else
	{
		sl->data = data;
		sl->next = NULL;
	}
	return sl;
}
//头插结点
void SListPushFront(pSList* pHead, DataType data)
{
	assert(pHead);
	pSList pcr = CreatNode(data);
	if (NULL != pcr)
	{
		if (*pHead == NULL)
		{
			*pHead = pcr;
			return;
		}
			pcr->next = *pHead;
			*pHead = pcr;
	}
}
//尾插结点
void  SListpushBack(pSList* pHead,DataType data)
{
	assert(pHead);
	pSList pur = *pHead;
	pSList pcr = CreatNode(data);
	if (pcr != NULL)
	{
		
			if (NULL == (*pHead))
			{
				*pHead = pcr;
				return;
			}
			else
			{
				while (pur->next)
				{
					pur= pur->next;
				}
				pur->next = pcr;
			}
	}
	else
	{
		printf("结点创建失败！\n");
		return;
	}
}
//头删结点
void SListPopFront(pSList* pHead)
{
	if (NULL == *pHead)
	{
		return;
	}
	 pSList pcr;
	pcr = *pHead;
	*pHead = (*pHead)->next;
	free(pcr);
}
//尾删结点
void SListPopBack(pSList* pHead)
{
	assert(pHead);
	pSList pcr = *pHead;
	if (NULL == pcr)
	{
		return;
	}
	pSList pur = (*pHead)->next;
		if (NULL == pur)
		{
			free(*pHead);
			*pHead = NULL;
		}
		else 
		{
			while (pur->next)
			{
				pcr = pur;
				pur = pur->next;
			}
			pSList tem = pcr->next;
			pcr->next = NULL;
			free(tem);
		}
}

//在无头单链表中寻找指定数据
pSList SListFind(pSList pHead, DataType data)
{
	if (NULL!=pHead)
	{
		pSList pcr = pHead;
		while (pcr)
		{
			if (pcr->data == data)
			{
				printf("%d\n", pcr->data);
				return pcr;
			}
			pcr = pcr->next;
		}
	}
		return NULL;
}
//在指定位置插入指定数据
void SListInsert(pSList* pHead,int pos, DataType data)
{
	assert(pHead);
	int num=0;
	pSList pur = *pHead;
	while (pur)
	{
		pur = (pur)->next;
		num++;
	}
	if (pos >= 1 && pos <= num)
	{
		if (pos == 1)
		{
			SListPushFront(pHead, data);
			return;
		}
		else
		{
			if (pos == num)
			{
				SListpushBack(pHead, data);
				return;
			}
			else
			{
				pSList pcr = *pHead;
				pSList Node = CreatNode(data);
				
				while (pos - 2)
				{
					pcr = pcr->next;
				}
				pSList temp = pcr->next;
				pcr->next = Node;
				Node->next = temp;
			}
		}
	}
	else
	{
		printf("插入位置非法！\n");
		return;
	}
}
//销毁单链表
void SListDestroy(pSList* pHead)
{
	assert(pHead);
	pSList pcr = *pHead;
	while (pcr)
	{
		pSList temp = pcr;
		pcr = pcr->next;
		free(temp);
	}
	*pHead = NULL;
}
//求链表长度
int SListSize(pSList pHead)
{
	int len=0;
	assert(pHead);
	while (pHead)
	{
		pHead = pHead->next;
		len++;
	}
	printf("%d \n", len);
	return 0;
}
//删除指定数据
void SListRemoveAll(pSList *pHead, DataType data)
{
	int num=0;
	assert(pHead);
	pSList pcr = *pHead;
	pSList pur = NULL;
	pSList temp = NULL;
	while (pcr)
	{
		if (pcr->data == data)
		{
			if (pcr == *pHead)
			{
				temp = pcr;
				*pHead = pcr->next;
				pcr = *pHead;
				free(temp);
			}
			else
			{
				temp = pcr;
				pur->next = pcr->next;
				pcr = pcr->next;
				free(temp);
			}
		}
		else
		{
			pur = pcr;
			pcr = pcr->next;
		}
	}
}
//删除pos节点
void SListErase(pSList* pHead,pSList pos)
{
	assert(pHead);
	pSList pcr = *pHead;
	if (NULL == *pHead)
	{
		printf("链表为空\n");
		return;
	}
	pSList pur = pcr->next;
	if (*pHead = pos)
	{
		pSList temp = *pHead;
		*pHead = (*pHead)->next;
		free(temp);
		return;
	}
	else
	{
		while (pur)
		{
			if (pur == pos)
			{
				pSList temp = pos->next;
				pcr->next = pur->next;
				free(temp);
				return;
			}
			pcr = pur;
			pur = pur->next;
		}
		printf("链表中无该结点！\n");
	}
}


//冒泡排序
void SlistBubbleSort(pSList *pHead)
{
	assert(pHead);
	int num = 0;
	if (NULL == *pHead)
	{
		printf("链表为空！\n");
		return;
	}
	pSList pcr = *pHead;
	while (pcr)
	{
		pcr = pcr->next;
		num++;
	}
		pcr = *pHead;
		pSList pur = pcr->next;
		pSList chc = NULL;
		int i = 0;
		int j = 0;
			while(num--)//循环次数
		{ 
			chc = NULL;
			pcr = *pHead;
			pur = pcr->next;
			while(pur)//检测链表一次比较过程是否完成
			{
				if (pcr->data > pur->data)
				{
					if (pcr == *pHead)
					{
						pSList temp = pcr->next;
						pcr->next = pur->next;
						temp->next = *pHead;
						*pHead = temp;
					}
					else
					{
						pSList temp1 = pcr->next;
						pSList temp2 = chc->next;
						pcr->next = pur->next; 
						chc->next = temp1;
						pur->next = temp2;
					}
				}
				chc = pcr;
				pcr = pur;
				pur = pur->next;
			}
		}
	}
void ShowSList(pSList pHead)
{
	pSList pcr=pHead;
	if (NULL == pcr)
	{
		return;
	}
	while (pcr)
	{
		printf("%d->", pcr->data);
		pcr = pcr->next;
	}
	printf("NULL");
	printf("\n");
}
//删除所有值相同的元素（同SListRemoveAll）
void removeElements(pSList head, int val) {
	pSList pcr = head;
	pSList pur = NULL;
	pSList temp = NULL;
	while (pcr)
	{
		if (pcr->data == val)
		{
			if (pcr == head)
			{
				temp = pcr;
				pcr = head->next;
				head = head->next;
			}
			else
			{
				temp = pur->next;
				pur->next = pcr->next;
				pcr = pcr->next;
			}
			free(temp);
		}
		else
		{
			pur = pcr;
			pcr = pcr->next;
		}

	}
}

main.c

#include"SList.h"



void menu()
{
	printf("#########################################################\n");
	printf("******                单链表操作                   ******\n");
	printf("******1.头插结点                        2.尾插结点*******\n");
	printf("******3.头删结点                        4.尾删结点*******\n");
	printf("******5.找指定数据        6.在指定位置插入指定数据*******\n");
	printf("******7.求链表长度              8.删除所有指定数据*******\n");
	printf("******9.删除指定结点                   10.冒泡排序*******\n");
	printf("******11.销毁链表                         12.退出 *******\n");
	printf("#########################################################\n");
}

int main()
{
	pSList ps;
	SListInit(&ps);
	int choice;
	while (1)
	{
		menu();
		printf("请选择：\n");
		scanf("%d", &choice);
		switch (choice)
		{
		case 1:
			SListPushFront(&ps, 2);
			SListPushFront(&ps, 1);
			SListPushFront(&ps, 7);
			ShowSList(ps);
			break;
		case 2:
			SListpushBack(&ps, 5);
			SListpushBack(&ps, 8);
			SListpushBack(&ps, 0);
			ShowSList(ps);
			break;
		case 3:
			SListPopFront(&ps);
			ShowSList(ps);
			break;
		case 4:
			SListPopBack(&ps);
			ShowSList(ps);
			break;
		case 5:
			SListFind(ps, 7);
			break;
		case 6:
			SListInsert(&ps,2,4);
			ShowSList(ps);
			break;
		case 7:
			SListSize(ps);
			break;
		case 8:
			removeElements(ps, 2);
			ShowSList(ps);
			break;
		case 9:
			SListErase(&ps, ps);
			ShowSList(ps);
			break;
		case 10:
			SlistBubbleSort(&ps);
			ShowSList(ps);
			break;
		case 11:
			SListDestroy(&ps);
			ShowSList(ps);
			break;
		case 12:
			exit(1);
			break;
		default:
			printf("选择输入错误！\n");
			break;
		}
	}
	system("pause");
	return 0;
}