合并两个排序的链表（递归版）

最新推荐文章于 2022-08-15 16:07:41 发布

qq_lzq

最新推荐文章于 2022-08-15 16:07:41 发布

阅读量216

点赞数 1

分类专栏：剑指OFFER

本文链接：https://blog.csdn.net/qq_40722582/article/details/97492178

版权

剑指OFFER 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking


class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
		if(pHead1 == nullptr)//只有单个链表
			return pHead2;
		else if(pHead2 == nullptr)//同上
			return pHead1;
		if(pHead1 == nullptr && pHead2 == nullptr)//两个链表都是空的
			return nullptr;
        ListNode * first = pHead1;
		ListNode * second = pHead2;
		ListNode * merge = NULL;
		if(first->val <= second ->val)
		{
			merge= first;
			merge->next = Merge(first->next, second);
		}
		else
		{
			merge = second;
			merge->next = Merge(first, second->next);
		}
		return merge;
	}
};