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

#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;
}SingleList;

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

	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;
	}
}

//判断序列B是否为序列A的连续子序列
int continueSubsequence(SingleList* a_list, SingleList* b_list)
{
	SingleList* pa, * pb, * pre;
	pa = a_list->next;
	pb = b_list->next;
	pre = pa;//记录a表当前比较的结点，使a表的每个结点都要和b表从头开始比
	while (pa != NULL && pb != NULL)
	{
		if (pa->data == pb->data)//值相等，pa和pb指针同时下移
		{
			pa = pa->next;
			pb = pb->next;
		}
		else
		{
			pre = pre->next;//pre指向a表当前比较结点的下一个结点
			pa = pre;  //pa指向当前要比较的结点
			pb = b_list->next;  //pb指针指向B表的开始
		}
	}
	if (pb == NULL)//整个循环结束，pb指针指向NULL，则说明b表是a表的连续子序列
		return 1;
	else
		return 0;
}

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;
	int flag = 0;
	a_list = init_SingleList1();
	create_SingleListByTail1(a_list);
	printf("初始A链表为：\n");
	printf_SingleList1(a_list);

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

	flag = continueSubsequence(a_list, b_list);
	if (flag == 1)
		printf("B序列是A序列的连续子序列\n");
	else
		printf("B序列不是A序列的连续子序列\n");

	destory_SingleList(b_list);
	destory_SingleList(a_list);

	system("pause");
	return EXIT_SUCCESS;
}