BUPT 实验11_11_链表匹配

最新推荐文章于 2024-04-15 20:18:04 发布

邓某人的父亲

最新推荐文章于 2024-04-15 20:18:04 发布

阅读量1.5k

点赞数 2

分类专栏： BUPT 计导作业文章标签：其他

本文链接：https://blog.csdn.net/m0_62121252/article/details/124067648

版权

链表子序列数据结构 C语言算法

关键词由CSDN通过智能技术生成

BUPT 计导作业专栏收录该内容

25 篇文章 25 订阅

订阅专栏

实验11_11_链表匹配

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
struct Node
{
	int data;
	struct Node* next;
};
int main()
{
	struct Node* headA = (struct Node*)malloc(sizeof(struct Node));
	struct Node* headB = (struct Node*)malloc(sizeof(struct Node));
	headA->next = NULL;
	headB->next = NULL;
	struct Node* temp;
	int i;
	int countA=0,countB=0,countC=0;
	// 链表A
	temp=headA;
	while(1)
	{
		scanf("%d",&i);
		if(i==-1)
		{
			temp=temp->next;
			break;
		}
		countA++;
		struct Node* p = (struct Node*)malloc(sizeof(struct Node));
		p->data=i;
		p->next=NULL;
		temp->next=p;
		temp=p;
	}
	// 链表B
	temp=headB;
	while(1)
	{
		scanf("%d",&i);
		if(i==-1)
		{
			temp=temp->next;
			break;
		}
		countB++;
		struct Node* p = (struct Node*)malloc(sizeof(struct Node));
		p->data=i;
		p->next=NULL;
		temp->next=p;
		temp=p;
	}
	if(countA<countB)
	{
		printf("ListB is not the sub sequence of ListA.");
		return 0;
	}
	struct Node*pA,*pB;
	temp=headA->next;  //记录链表A 开始比较的点
	while(1)
	{
		countC=0;
		pA=temp;
		pB=headB->next;
		while(1)
		{
			if(pA==NULL||pB==NULL)
			{
				if(countC==countB)
					printf("ListB is the sub sequence of ListA.");
				else
					printf("ListB is not the sub sequence of ListA.");
				return 0;
			}
			else if(pA->data!=pB->data)
				break;
			else if(pA->data==pB->data)
			{
				countC++;  //相同元素的个数
				pA=pA->next;
				pB=pB->next;
			}
			if(countC==countB)
			{
				printf("ListB is the sub sequence of ListA.");
				return 0;
			}
		}
		temp=temp->next;
	}
}
//5 4 3 2 1 -1
//3 2 1 -1