王道数据结构链表算法题第二十四题

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <Windows.h>

struct node
{
	int data;
	struct node* next;
};
//初始化
struct node* InitSingleList()
{
	struct node* list = malloc(sizeof(struct node));
	if (list == NULL)
		return NULL;
	list->data = 0;
	list->next = NULL;

	return list;
}
//尾插法创建单链表
void CreateSingleListByTail(struct node* list)
{
	struct node* pmove, * pcreate, * head;
	int len, data;
	head = (struct node*)malloc(sizeof(struct node));
	head = list;
	if (head == NULL)
		return;
	else
		head->next = NULL;
	pmove = head;
	printf("请输入要创建的单链表的长度：");
	scanf_s("%d", &len);
	printf("请输入数据：\n");
	for (int i = 0; i < len; i++)
	{
		scanf_s("%d", &data);
		pcreate = (struct node*)malloc(sizeof(struct node));
		if (pcreate == NULL)
			return;
		pcreate->data = data;
		pcreate->next = NULL;
		pmove->next = pcreate;
		pmove = pcreate;
	}
}
void DeleteSameValueFromSingleList(struct node* list)
{
	struct node* pmove, * pre, * qmove, * delete, * save;
	pmove = list->next;//指向当前要比较的结点
	while (pmove != NULL)
	{
		pre = pmove;//保存当前结点，pre用于删除结点时，删除结点的前驱结点与删除结点的后继结点的连接
		qmove = pmove->next;//qmove指向当前结点的后一个结点，从该结点开始依次与pmove中数据进行比较
		while (qmove != NULL)//从qmove指向结点开始遍历链表，依次与pmove结点进行比较
		{
			if (abs(pmove->data) == abs(qmove->data))//删除绝对值相同的数据
			{
				delete = qmove;
				save = qmove->next;
				pre->next = qmove->next;
				qmove = save;
				free(delete);
			}
			else
			{
				//当结点值不同时，pre指针指向qmove的位置，pre始终指向qmove的前驱结点，然后qmove指针下移
				pre = qmove;
				qmove = qmove->next;
			}
		}
		//当qmove指向NULL时，表示一轮遍历结束，进行下一个结点的判断，直到pmove为NULL表示所有结点都判断完成
		pmove = pmove->next;
	}
}
void Show(struct node* list)
{
	struct node* pmove;
	pmove = list->next;
	while (pmove != NULL)
	{
		printf("%d ", pmove->data);
		pmove = pmove->next;
	}
	printf("\n");
}
//销毁单链表
void destory_SingleList(struct node* list)
{
	struct node* currentNode, * nextNode;
	currentNode = list->next;
	while (currentNode != NULL)
	{
		nextNode = currentNode->next;
		free(currentNode);
		currentNode = nextNode;
	}
	free(list);
	list = NULL;
}
int main(void)
{
	struct node* list;
	list = InitSingleList();
	CreateSingleListByTail(list);
	printf("初始单链表为：\n");
	Show(list);
	printf("删除链表中相同数据后的链表为：\n");
	DeleteSameValueFromSingleList(list);
	Show(list);

	destory_SingleList(list);

	system("pause");
	return EXIT_SUCCESS;
}