（无头结点不循环）单链表基本操作

最新推荐文章于 2022-05-09 23:47:46 发布

Novice Player

最新推荐文章于 2022-05-09 23:47:46 发布

阅读量314

点赞数

本文链接：https://blog.csdn.net/Watery________1314/article/details/84729854

版权

我们对此分为三个文件，两个源文件SList.c main.c 和一个头文件SList.h

SList.h 中用来包含头文件，定义结构体，和对函数的声明；SList.c 中写对函数的实现； main.c 中是主函数和测试函数

"SList.h"

#pragma once

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>

typedef int SLDataType;

typedef struct SListNode {
	SLDataType data;
	struct SListNode *next;
}SListNode;

typedef struct SList {
	struct SListNode *first;
}SList;

// 初始化
void SListInit(SList *list);

// 申请空间
SListNode *BuySListNode(SLDataType data);

// 销毁
void SListDestroy(SList *list);

// 头插
void SListPushFront(SList *list, SLDataType data);

// 头删
void SListPopFront(SList *list);

// 尾插
void SListPushBack(SList *list, SLDataType data);

// 尾删
void SListPopBack(SList *list);

// 查找
// NULL 表示没找到
SListNode * SListFind(SList *list, SLDataType data);

// 在 pos 这个结点后面插入新结点
void SListInsertAfter(SListNode *pos, SLDataType data);

// 删除 pos 这个结点后面的结点(pos 不是最后一个结点)
void SListEraseAfter(SListNode *pos);

// 删除第一个遇到的 data 结点
void SListRemove(SList *list, SLDataType data);

// 打印
void SListPrint(SList *list);

// 移除链表元素(删掉所有此元素)
void SListRemoveElements(SList *list, SLDataType data);

// 反转单链表(两种方法)
void SListReverse1(SList *list);
void SListReverse2(SList *list);

"SList.c"

#include"SLIst.h"

void SListInit(SList *list)
{
	assert(list != NULL);
	list->first = NULL;
}

SListNode *BuySListNode(SLDataType data)
{
	SListNode *NewNode = (SListNode *)malloc(sizeof(SListNode));
	assert(NewNode != NULL);  // 防御性代码
	NewNode->data = data;
	NewNode->next = NULL;
	return NewNode;
}

void SListDestroy(SList *list)
{
	SListNode *next; // 临时存放cur->next,防止释放cur后找不到
	for (SListNode *cur = list->first; cur != NULL; cur = next)
	{
		next = cur->next;
		free(cur);
	}
	list->first = NULL;
}

void SListPrint(SList *list)
{
	assert(list != NULL);
	for (SListNode *cur = list->first; cur != NULL; cur = cur->next)
	{
		printf("%d-->", cur->data);
	}
	printf("NULL\n");
}

void SListPushFront(SList *list, SLDataType data)
{
	assert(list != NULL);
	// 1.创建空间
	SListNode *node = BuySListNode(data);
	// 2.此节点的next指向之前的第一个节点
	node->next = list->first;
	// 3.将第一个节点调整为此节点
	list->first = node;
}

void SListPopFront(SList *list)
{
	assert(list != NULL);        // 无链表
	assert(list->first != NULL); // 有链表，但是为空，即没有节点
	SListNode *old = list->first;
	list->first = list->first->next;
	free(old);
}

void SListPushBack(SList *list, SLDataType data)
{
	assert(list != NULL);
	//链表为空
	if (list->first == NULL)
	{
		SListPushFront(list, data);
		return;
	}
	//找到最后的NULL前面的节点(链表不为空)
	SListNode *lastone = list->first;
	for (; lastone->next != NULL; lastone = lastone->next){
	}

	SListNode *node = BuySListNode(data);
	lastone->next = node;
}

void SListPopBack(SList *list)
{
	assert(list != NULL);        //无链表
	assert(list->first != NULL); //有链表，为空

	//链表只有 1个节点
	if (list->first->next == NULL)
	{
		SListPopFront(list);
		return;
	}
	//找到最后的NULL前面的节点的上一个节点(链表有 2个及以上节点)
	SListNode *lasttwo = list->first;
	for (; lasttwo->next->next != NULL; lasttwo = lasttwo->next) {
	}
	free(lasttwo->next);
	lasttwo->next = NULL;
}

SListNode * SListFind(SList *list, SLDataType data)
{
	assert(list != NULL);
	for (SListNode *cur = list->first; cur != NULL; cur = cur->next)
	{
		if (cur->data == data)
		{
			return cur;  
		}
	}
	return NULL;  //没找到，返回NULL
}


void SListRemove(SList *list, SLDataType data)
{
	assert(list != NULL);
	SListNode *prev = NULL;
	SListNode *cur = list->first;

	//找要删的前一个节点
	while ((cur != NULL) && (cur->data != data))
	{
		prev = cur;
		cur = cur->next;
	}

	// 1. cur == NULL，没找到要删除的节点
	// 2. cur != NULL
	//    a. prev == NULL，要删的在第一个节点，头删
	//    b. prev != NULL，直接删prev->next

	// 1
	if (cur == NULL)
	{
		return;
	}

	// 2.a
	if (prev == NULL)
	{
		SListPopFront(list);
		return;
	}

	// 2.b
	prev->next = cur->next;
	free(cur);
}

void SListInsertAfter(SListNode *pos, SLDataType data)
{
	assert(pos != NULL);

	SListNode * NewNode = BuySListNode(data);
	NewNode->next = pos->next;
	pos->next = NewNode;
}

void SListEraseAfter(SListNode *pos)
{
	assert(pos != NULL);
	assert(pos->next != NULL);

	SListNode * old = pos->next;
	pos->next = pos->next->next;
	free(old);
}

void SListRemoveElements(SList *list, SLDataType data)
{
	assert(list != NULL);

	if (list->first == NULL) 
	{
		return;
	}
	
	SListNode *prev = list->first;
	SListNode *cur = list->first->next;
	//从第二个节点开始判断
	while (cur != NULL) 
	{
		if (cur->data != data) 
		{
			prev = cur;
		}
		else 
		{
			prev->next = cur->next;
			free(cur);
		}
		cur = prev->next;
	}
	//判断第一个节点
	SListNode *newHead = list->first;
	if (list->first->data == data)
	{
		newHead = list->first->next;
		free(list->first);
	}
	list->first = newHead;
}


void SListReverse1(SList *list)
{
	assert(list != NULL);
	SListNode *newHead = NULL;
	SListNode *node;

	while (list->first != NULL) 
	{
		// 对之前的链表做头删(没释放，只是放到node中)
		node = list->first;
		list->first = list->first->next;

		// 对新链表做头插（将node插入）
		node->next = newHead;
		newHead = node;
	}
	list->first = newHead;
}


void SListReverse2(SList *list)
{
	if (list->first == NULL)
	{
		return;
	}

	SListNode *p0 = NULL;
	SListNode *p1 = list->first;
	SListNode *p2 = list->first->next;

	while (p1 != NULL) 
	{
		p1->next = p0;

		p0 = p1;
		p1 = p2;
		if (p2 != NULL)
		{
			p2 = p2->next;
		}
	}

	list->first = p0;
}

"main.c"

#include"SList.h"

void test()
{
	SList list;
	SListInit(&list);
	SListPushFront(&list, 1);
	SListPushFront(&list, 2);
	SListPushFront(&list, 3);
	SListPrint(&list);

	SListPopFront(&list);
	SListPrint(&list);
	SListPopFront(&list);
	SListPrint(&list);
	SListPopFront(&list);
	SListPrint(&list);

	SListPushFront(&list, 1);
	SListPushFront(&list, 2);
	SListPushFront(&list, 3);
	SListPrint(&list);

	SListDestroy(&list);
	SListPrint(&list);

	SListPushBack(&list, 1);
	SListPrint(&list);
	SListPushBack(&list, 2);
	SListPrint(&list);
	SListPushBack(&list, 3);
	SListPrint(&list);
	SListPushBack(&list, 4);
	SListPrint(&list);

	SListPopBack(&list);
	SListPrint(&list);
	SListPopBack(&list);
	SListPrint(&list);
	SListPopBack(&list);
	SListPrint(&list);
	SListPopBack(&list);
	SListPrint(&list);

	SListPushFront(&list, 1);
	SListPushFront(&list, 2);
	SListPushFront(&list, 3);
	SListPrint(&list);

	SListRemove(&list, 5);
	SListPrint(&list);
	SListRemove(&list, 2);
	SListPrint(&list);

	//SListNode *pos0 = SListFind(&list, 10);   //找不到10，返回为NULL
	SListNode *pos1 = SListFind(&list, 1);
	SListNode *pos2 = SListFind(&list, 3);
	//SListInsertAfter(pos0, 15);               //pos0为NULL，断言失败，程序崩溃
	SListInsertAfter(pos1, 16);
	SListPrint(&list);
	SListInsertAfter(pos2, 17);
	SListPrint(&list);
	//SListEraseAfter(pos0);                    //pos0为NULL，断言失败，程序崩溃
	SListEraseAfter(pos1);
	SListPrint(&list);
	//SListEraseAfter(pos1);                    //这次pos1->next == NULL，断言失败，程序崩溃
	SListEraseAfter(pos2);
	SListPrint(&list);

	SListDestroy(&list);

	SListPushFront(&list, 1);
	SListPushFront(&list, 1);
	SListPushFront(&list, 1);
	SListPushFront(&list, 2);
	SListPushFront(&list, 1);
	SListPushFront(&list, 1);
	SListPrint(&list);

	SListRemoveElements(&list, 1);
	SListPrint(&list);
	SListDestroy(&list);

	SListPushFront(&list, 1);
	SListPushFront(&list, 2);
	SListPushFront(&list, 3);
	SListPushFront(&list, 4);
	SListPushFront(&list, 5);
	SListPushFront(&list, 6);
	SListPrint(&list);

	SListReverse1(&list);
	SListPrint(&list);
	SListReverse2(&list);
	SListPrint(&list);
}



int main()
{
	test();
	system("pause");
	return 0;
}

以上便是我写的对顺序表功能的实现，同样的其中的main.c 文件中的 test 函数是我自己在实现过程中的测试，可以有自己的测试方法，不一定按部就班，只要能对函数功能进行检测即可。

Novice Player

关注

0
点赞
踩
2

收藏

觉得还不错? 一键收藏
0
评论
（无头结点不循环）单链表基本操作

我们对此分为三个文件，两个源文件SList.c main.c 和一个头文件SList.hSList.h 中用来包含头文件，定义结构体，和对函数的声明；SList.c 中写对函数的实现； main.c 中是主函数和测试函数 "SList.h"#pragma once#define _CRT_SECURE_NO_WARNINGS 1#include&lt;stdio.h&gt...
复制链接

扫一扫