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

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

typedef struct node
{
	int data;
	struct node* next;
	int size;
}SingleList;

//初始化
SingleList* init_SingleList1()
{
	SingleList* list = malloc(sizeof(SingleList));
	if (list == NULL)
		return NULL;
	list->data = 0;
	list->next = NULL;
	list->size = 0;

	return list;
}

//尾插法创建单链表
void create_SingleListByTail1(SingleList* list)
{
	SingleList* head, * pmove, * pcreate;
	int len, data;
	head = (SingleList*)malloc(sizeof(SingleList));
	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 = (SingleList*)malloc(sizeof(SingleList));
		if (pcreate == NULL)
			return;
		pcreate->data = data;
		pcreate->next = NULL;

		//插入操作
		pmove->next = pcreate;
		pmove = pcreate;

		list->size++;
	}
}

//冒泡排序
void bubbleSort_SingleList1(SingleList* list)
{
	SingleList* current, * currentNext;
	
	for (int i = 0; i < list->size - 1; i++)
	{
		current = list->next;
		currentNext = current->next;
		for (int j = 0; j < list->size - i - 1; j++)
		{
			if (current->data > currentNext->data)
			{
				int temp = current->data;
				current->data = currentNext->data;
				currentNext->data = temp;
			}
			current = current->next;
			currentNext = currentNext->next;
		}
	}
}

//找两个链表中的公共结点
void findSameValueFrom_SingleList(SingleList* a_list, SingleList* b_list)
{
	SingleList* pmove, * pa, * pb, * save, * delete;

	pmove = a_list;//pmove指向a表的头结点，工作指针
	pa = a_list->next;//pa指向a表的第一个数据结点
	pb = b_list->next;//pb指向b表的第一个数据结点
	pmove->next = NULL;//断开a表的头结点，让a表的头结点当做新生成表的头结点
	while (pa != NULL)
	{
		if (pa->data == pb->data)
		{
			save = pa->next;//保存后继结点
			//找到两表的公共结点，用原来a表的头结点当新表的头结点，然后尾插法进行链接
			pa->next = NULL;
			pmove->next = pa;
			//链接后指针下移，进行下一轮
			pmove = pa;
			pa = save;
			//pb = pb->next;
		}
		else
			if (pa->data < pb->data)//当不等时，若a表当前值小于b表当前值，删除a表的当前值，pa指针下移
			{
				delete = pa;
				pa = pa->next;
				free(delete);
			}
			else
				if (pa->data > pb->data)//当不等时，若是b表当前值大于a表当前值，pb指针下移
					pb = pb->next;
	}
}

//打印
void printf_SingleList1(SingleList* list)
{
	SingleList* pmove;
	pmove = list->next;
	while (pmove != NULL)
	{
		printf("%d ", pmove->data);
		pmove = pmove->next;
	}
	printf("\n");
}
//销毁单链表
void destory_SingleList(SingleList* list)
{
	SingleList* currentNode, * nextNode;
	currentNode = list->next;
	while (currentNode != NULL)
	{
		nextNode = currentNode->next;
		free(currentNode);
		currentNode = nextNode;
	}
	free(list);
	list = NULL;
}
int main(void)
{
	SingleList* a_list, * b_list;
	a_list = init_SingleList1();
	create_SingleListByTail1(a_list);
	bubbleSort_SingleList1(a_list);
	printf("初始有序的A链表为：\n");
	printf_SingleList1(a_list);

	b_list = init_SingleList1();
	create_SingleListByTail1(b_list);
	bubbleSort_SingleList1(b_list);
	printf("初始有序的B链表为：\n");
	printf_SingleList1(b_list);

	findSameValueFrom_SingleList(a_list, b_list);
	printf("由相同结点构成的链表为：\n");
	printf_SingleList1(a_list);

	destory_SingleList(b_list);
	destory_SingleList(a_list);

	system("pause");
	return EXIT_SUCCESS;
}