LeetCode: 21. Merge Two Sorted Lists / 23. Merge k Sorted Lists

最新推荐文章于 2024-09-14 00:15:00 发布

Evillla

最新推荐文章于 2024-09-14 00:15:00 发布

阅读量151

点赞数

分类专栏：剑指Offer和Leetcode

本文链接：https://blog.csdn.net/La745739773/article/details/89915654

版权

剑指Offer和Leetcode 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

21. Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Example:

Input:
[
  1->4->5,
  1->3->4,
  2->6
]
Output: 1->1->2->3->4->4->5->6

第一题将两个有序的链表合并成一个，第二题将k个有序链表合并成一个；归并排序的思想，由于链表是由指针控制的，因此给与了更多的操作空间。这里用递归的方法实现归并：

    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if(l1 == NULL)
            return l2;
        if(l2 == NULL)
            return l1;
        if(l1 -> val < l2 -> val)
        {
            l1->next = mergeTwoLists(l1->next,l2);
            return l1;
        }
        else
        {
            l2->next = mergeTwoLists(l1,l2->next);
            return l2;
        }
    }
ListNode* mergeKLists(vector<ListNode*>& lists) {
    if(lists.empty()){
        return nullptr;
    }
	while (lists.size() >= 2)
	{
		lists.push_back(mergeTwoLists(lists[0],lists[1]));
        lists.erase(lists.begin());
        lists.erase(lists.begin());
	}
	return lists[0];
}