【数据结构】合并两个有序链表,合并后依然有序

最新推荐文章于 2021-12-22 16:52:05 发布

原创最新推荐文章于 2021-12-22 16:52:05 发布 · 403 阅读

0 ·

CC 4.0 BY-SA版权

神兵利剑专栏收录该内容

34 篇文章

订阅专栏

本文详细介绍了两种单链表合并的方法：递归和非递归。通过对比不同场景下的操作，如当两个链表的数据相等、第一个链表的数据小于第二个链表的数据，以及第一个链表的数据大于第二个链表的数据时的处理方式，深入解析了单链表的合并过程。此外，还提供了完整的代码示例，帮助读者理解算法的具体实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

单链表的实现：https://blog.youkuaiyun.com/weixin_41892460/article/details/82855823

//递归
pList Merge(pList list1, pList list2)
{
	pList newlist = NULL;
	if (NULL == list1)
	{
		return list2;
	}
	if (NULL == list2)
	{
		return list1;
	}
	if (NULL == list1 &&  NULL == list2)
	{
		return NULL;
	}
	if ((list1)->data == (list2)->data)
	{
		newlist = list1;
		newlist->next = Merge_R((list1)->next, (list2)->next);
	}
	if ((list1)->data < (list2)->data)
	{
		newlist = list1;
		newlist->next = Merge_R((list1)->next, list2);
	}
	if ((list1)->data >(list2)->data)
	{
		newlist = list2;
		newlist->next = Merge_R(list1, (list2)->next);
	}
	while (list1)
	{
		list1 = (list1)->next;
	}
	while (list2)
	{
		list2 = (list2)->next;
	}
	return newlist;
}

//非递归
pList Merge_R(pList list1, pList list2)
{
	pList newlist = NULL;
	pNode cur = NULL;
	if (list1 == NULL)
		newlist = list2;
	if (list2 == NULL)
		newlist = list1;
if (NULL == list1 &&  NULL == list2)
	{
		return NULL;
	}
	if (list1->data == list2->data)
	{
		cur = BuyNode(list1->data);
		list2 = list2->next;
		list1 = list1->next;
		newlist = cur;
	}
	else if (list1->data > list2->data)
	{
		cur = BuyNode(list2->data);
		list2 = list2->next;
		newlist = cur;
	}
	else  if (list1->data < list2->data)
	{
		cur = BuyNode(list1->data);
		list1 = list1->next;
		newlist = cur;
	}
	while (list1&&list2)
	{
		if (list1->data >= list2->data)
		{
			cur->next = BuyNode(list2->data);
			list2 = list2->next;
			cur = cur->next;
		}
		else if (list1->data < list2->data)
		{
			cur->next = BuyNode(list1->data);
			list1 = list1->next;
			cur = cur->next;
		}
	}
	while (list1)
	{
		cur->next = BuyNode(list1->data);
		list1 = list1->next;
		cur = cur->next;
	}
	while (list2)
	{
		cur->next = BuyNode(list2->data);
		list2 = list2->next;
		cur = cur->next;
	}
	return newlist;

}