LeetCode之Merge k Sorted Lists

最新推荐文章于 2024-04-03 21:24:25 发布

wteo

最新推荐文章于 2024-04-03 21:24:25 发布

阅读量849

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode leetcode

本文链接：https://blog.youkuaiyun.com/smileteo/article/details/21833837

LeetCode 同时被 2 个专栏收录

55 篇文章

订阅专栏

leetcode

46 篇文章

订阅专栏

本文详细介绍了如何将多个已排序的链表合并为一个有序链表，通过逐步分析和实现，提供了高效解决方案。

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

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

多遍LeetCode之Merge Two Sorted Lists思想

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *mergeKLists(vector<ListNode *> &lists) {
        if (lists.size() == 0) return NULL;
		 while (lists.size()>1){
			 ListNode *mergelist = new ListNode(0);
			 ListNode *p = lists[0];
			 ListNode *q = lists[lists.size()-1];
			 lists.pop_back();
			 lists[0]=mergeTwoLists(p, q);
		 }
		 return lists[0];
    }
    
     ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
		 ListNode *list = new ListNode(0);
		 ListNode *p, *q, *r;
		 p = l1; q = l2; r = list;
		 while (p&&q){
			 if (p->val <= q->val){
				 r->next = p;
				 p = p->next;
			 }
			 else {
				 r->next = q;
				 q = q->next;
			 }
			 r = r->next;
		 }//while
		 r->next = q ? q : p;
		 return list->next;
	 }
};