算法分析与设计——LeetCode Problem.23 Merge k Sorted Lists

最新推荐文章于 2024-02-04 15:23:14 发布

SYSU_Chan

最新推荐文章于 2024-02-04 15:23:14 发布

阅读量225

点赞数

分类专栏：算法分析与设计

本文链接：https://blog.csdn.net/SYSU_Chan/article/details/78286498

版权

算法分析与设计专栏收录该内容

31 篇文章 0 订阅

订阅专栏

题目链接

问题描述

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

解题思路

比较容易想到的是将链表逐个进行合并，但是这样会超时。最后用到分治法，顺利通过。

class Solution {
public:
	ListNode* mergeKLists(vector<ListNode*>& lists) {
		int leng = lists.size();
		if (leng == 0) {
			return NULL;
		}
		while (lists.size() > 1){
			lists.push_back(mergeList(lists[0], lists[1]));
			lists.erase(lists.begin());
			lists.erase(lists.begin());
		}
		return lists.front();

	}

	ListNode *mergeList(ListNode *l1, ListNode *l2) {
		ListNode *head = new ListNode(NULL);
		ListNode *p1 = head;
		ListNode *follow = head;
		if (l1 == NULL) {
			return l2;
		}
		if (l2 == NULL) {
			return l1;
		}
		while (l1 != NULL && l2 != NULL) {
			if (l1->val < l2->val) {
				p1->val = l1->val;
				l1 = l1->next;
			}
			else {
				p1->val = l2->val;
				l2 = l2->next;
			}
			p1->next = new ListNode(NULL);
			follow = p1;
			p1 = p1->next;
		}
		if (l1 == NULL) {
			if (l2 != NULL) {
				follow->next = l2;
			}
			else {
				return head;
			}
		}
		if (l2 == NULL) {
			if (l1 != NULL) {
				follow->next = l1;
			}
			else {
				return head;
			}
		}
		return head;
	}
};