数据结构课设之带环相交链表

题目

1. 1.构造链表后，将元素值为 m 和 n（从键盘输入，如有多个相同元素值，仅考虑首个出现的 元素）的节点建立连接，注意判断节点出现的先后关系，将后面出现的节点（假设为 n）的 链域连到先出现的节点（假设为 m），将原 n节点的后续节点搬迁到原单链表的头部，形成 以下双头相交链表（如果使用带头结点的链表，搬迁过程中请自行额外增加一个头节点）；

   2.利用课程 ppt 中关于判断链表是否有环的方法，判断链表是否有环路，并求出环路出现的 位置，即 m，n 节点的指针，请使用环路判断函数（输入为链表头指针），不可直接查找 m,n， 支持使用 2个不同的链表头部指针进行查询；

   3.将环路链接取消，恢复成单链表，并根据表头指针（输入）求解链表的中间节点（输出中 间节点的值并返回指针），注意：不要将链表转换成数组来求解；

   4.编写函数，判断两个链表是否相交，函数输入为双头相交链表的两个头指针并输出相交的 指针，如没有相交则返回 NULL。注意：判断相交是基于指针的比较（判断是否有相同的节 点指针出现在两个链表中）而不是节点的值的比较。

//主要功能代码已注释
//vs2019可以正常运行
#include <iostream>
using namespace std;

class Date
{
public:
	int date;
	Date* next;
};

class List : public Date
{
public:
	Date* Head1;
	Date* Head2;
	List();
	void List_set();				//单链表构造函数	
	void List_change();				//链表改造函数
	Date* List_ring(Date* head);	//判断是否成环函数
	void List_recover();			//复原函数
	Date* List_intersect();			//判断是否相交函数
	void List_show1();				//从Head1输出
	void List_show2();
};

List::List()
{
	Head1 = new Date;
	Head2 = new Date;
	Head1->next = NULL;
	Head2->next = NULL;
}


void List::List_set()
{
	cout << "请输入单链表的数据" << endl;
	Date* p, * a;
	a = Head1;
	int num;
	while (1)
	{
		p = new Date;
		cin >> num;
		if (num != 0)
		{
			p->date = num;
			p->next = a->next;
			a->next = p;
			a = a->next;
		}
		else break;
	}
}

void List::List_change()
{
	cin.ignore(std::numeric_limits< streamsize >::max(), '\n'); //清空输入流
	int m, n, a = 0;
	Date* pos_1st = NULL, * pos_2st = NULL, * p;
	p = Head1->next;
	cout << "请输入两个关键节点来构造双头相交链表" << endl;
	cin >> m >> n;
	while (p != NULL)
	{
		if (!pos_1st)
		{
			if (p->date == m && a == 0) //a 用来区分遇到先遇到还是后遇到
			{
				pos_1st = p;
				a++;
				m = 1000;				//避免再次遇到值为 m 的节点误
			}							//以为是第二个节点
			else if (p->date == n && a == 0)
			{
				pos_1st = p;
				a++;
				n = 1000;
			}
		}
		if (!pos_2st)
		{
			if (p->date == m && a == 1)
			{
				pos_2st = p;
				a++;
			}
			else if (p->date == n && a == 1)
			{
				pos_2st = p;
				a++;
			}
		}

		if (p->next == NULL)
		{					//a!=2 说明 n,m 至少有一个不存在与链表
			if (a != 2) { cout << "输入的数据不存在" << endl; return; }
		}
		p = p->next;
	}
	p = pos_2st;
	while (p->next != NULL) p = p->next;	//遍历到链表尾
	p->next = pos_1st;					//将链表尾的指针域指向 pos_1st
	Head2->next = pos_2st->next;		//构建双头链表
	pos_2st->next = pos_1st;			//构建循环
	cout << "改造成功" << endl;
}

void List::List_show1()
{
	if (Head1 == NULL)
	{
		cout << "无数据" << endl;
		return;
	}
	Date* p;
	p = Head1->next;
	if (p == NULL) { cout << "无数据" << endl; return; }
	for (int i = 0; i < 15; i++)
	{

		cout << p->date << "  ";
		p = p->next;
		if (p == NULL) break;
	}
	cout << endl;
}

void List::List_show2()
{
	if (Head2 == NULL)
	{
		cout << "无数据" << endl;
		return;
	}
	Date* p;
	p = Head2->next;
	if (p == NULL) { cout << "无数据" << endl; return; }
	for (int i = 0; i < 15; i++)
	{

		cout << p->date << "  ";
		p = p->next;
		if (p == NULL) break;
	}
	cout << endl;
}

Date* List::List_ring(Date* head)
{
	Date* p1, * p2;
	p1 = head;
	p2 = p1;
	while (p1->next != NULL && p2->next != NULL)
	{
		p1 = p1->next;				//采用异步指针
		p2 = p2->next->next;
		if (!p2) break;				//p2=NULL 则说明不存在环
		if (p1 == p2)				//如果有环
		{
			p1 = head;
			while (p1->next != NULL && p2->next != NULL)
			{			    //将一个指针复原，两个指针每次只跳一步
				p1 = p1->next;
				p2 = p2->next;
				if (p1 == p2)	//两指针相等时即为环路入口
				{
					while (p2->next != p1) p2 = p2->next;
					return p2;	//p2 为环路中环路入口的上一个指针
				}
					
			}
		}

	}
	cout << "链表不存在回路" << endl;
	return NULL;
}


void List::List_recover()
{
	Date* pos_1st = List_ring(Head1)->next;	//找到值为 m 的节点
	Date* pos_2nd = List_ring(Head1);		//找到值为 n 的节点
	Date* p;
	pos_2nd->next = Head2->next;
	for ( p = Head2; p->next != pos_1st; p = p->next) {};
	Head2->next = NULL;
	p->next = NULL;
}


Date* List::List_intersect()
{
	Date *last=List_ring(Head1);
	Date* last_next = last->next;
	last->next = NULL;				//将链表中环路解开
	int len1=0, len2=0,pos;
	Date* p = Head1;
	Date* q = Head2;
	for (; p->next != NULL; p = p->next) len1++;	//计算两个链表的长度
	for (; q->next != NULL; q = q->next) len2++;
	if (len1 > len2)
	{
		pos = len1 - len2;			//pos 用来记录两链表长度的差值
		for (; pos >= 0; pos--)		//让长的链表先走 pos 步
		{
			p = Head1;
			q == Head1;
			p = p->next;
		}
	}
	else if (len1 < len2)
	{
		pos = len2 - len1;
		p = Head1;
		q = Head2;
		q = q->next;
	}
	else pos = 0;
	while (p != q)
	{
		p = p->next;
		q = q->next;
	}
	last->next = last_next;
	return p;
}

void menu()
{
	cout << "       ----------------------------------------------" << endl;
	cout << "       |                                             | " << endl;
	cout << "       |     如需新建链表请按             1          | " << endl;
	cout << "       |     如需改造链表请按             2          | " << endl;
	cout << "       |     如需判断是否成环请按         3          | " << endl;
	cout << "       |     如需查找双头链表相交处请按   4          | " << endl;
	cout << "       |     如需恢复链表请按             5          | " << endl;
	cout << "       |     如需从Head1输出链表请按      6          | " << endl;
	cout << "       |     如需从Head2输出链表请按      7          | " << endl;
	cout << "       |     如需退出系统请按             0          |" << endl;
	cout << "       |                                             | " << endl;
	cout << "        ----------------------------------------------" << endl;
}






int main()
{
	int k;
	List list;
	Date* temp=NULL;
	while (1)
	{
		menu();
		cout << "请问您要执行哪一个功能呢，请输入相应数字" << endl;
		cin >> k;
		switch (k)
		{
		case 1:
			list.List_set();
			cout << "输入成功" << endl;
			break;
		case 2:
			if (list.Head1->next == NULL)
			{
				cout << "单链表无数据，请确定是否正确构建单链表" << endl;
				break;
			}
			list.List_change();
			break;
		case 3:
			int i;
			cout << "从哪个链头进行判断,1->Head1,2->Head2" << endl;
			cin >> i;
			if (i == 1) {
				if (!list.Head1->next) {
					cout << "链表内无数据，请确认链表是否正确" << endl;
					break;
				}
				temp = list.List_ring(list.Head1);
			}
			else if (i == 2) {
				if (!list.Head2->next) {
					cout << "链表内无数据，请确认链表是否正确" << endl;
					break;
				}
				temp = list.List_ring(list.Head2);
			}
			else cout << "输入错误请重试" << endl;
			if (temp != NULL)
			{
				cout << "环的节点分别为" << temp << "  " << temp->next << endl;
				cout << "对应的值为" << temp->date << " " << temp->next->date << endl;
			}
			break;
		case 4:
			if (!list.Head1->next || !list.Head2->next)
			{
				cout << "双头链表存在问题，无法判断是否相交" << endl; break;
			}
			cout << "环的节点为" << list.List_intersect() << "它的值为" << list.List_intersect()->date <<endl;
			break;
		case 5:
			if (!list.Head1->next || !list.Head2->next)
			{
				cout << "双头链表存在问题，无法恢复" << endl; break;
			}
			list.List_recover();
			break;
		case 6:
			list.List_show1();
			break;
		case 7:
			list.List_show2();
			break;
		case 0:
			exit(0);
		default:
			break;
		}
	}
}