LeetCode 148. Sort List

最新推荐文章于 2022-09-04 18:20:54 发布

stephen_wong

最新推荐文章于 2022-09-04 18:20:54 发布

阅读量782

点赞数

分类专栏： LeetCode 排序 LeetCode Problems 文章标签： LeetCode C++

本文链接：https://blog.csdn.net/stephen_wong/article/details/27946467

版权

LeetCode 同时被 3 个专栏收录

186 篇文章 0 订阅

订阅专栏

LeetCode Problems

183 篇文章 2 订阅

订阅专栏

排序

6 篇文章 0 订阅

订阅专栏

参考了别人的题解，用了归并排序。

实现O(nlogn)复杂度的排序方法有归并、快排和堆排序。

有时间的话还应该去复习一下这三种方法实现以及复杂度的证明。

代码：

class Solution
{
public:
	ListNode* sortList(ListNode* head)
	{
		if (head == NULL || head->next==NULL)
		{
			return head;
		}

		ListNode* fast=head, *slow=head;
		for ( ; fast->next!=NULL&&fast->next->next!=NULL; fast=fast->next->next, slow=slow->next) {}
		fast = slow;
		slow = slow->next;
		fast->next = NULL;
		fast = sortList(head); // half before 
		slow = sortList(slow); // half after

		return merge(fast, slow);
	}

	ListNode* merge(ListNode* before, ListNode* after)
	{
		ListNode* head;
		if ( before->val < after->val )
		{
			head = before;
			before = before->next;
		} else
		{
			head = after;
			after = after->next;
		}

		ListNode* now = head;
		while ( before!=NULL && after!=NULL )
		{
			if (before->val < after->val)
			{
				now->next = before;
				before = before->next;
			} else
			{
				now->next = after;
				after = after->next;
			}
			now = now->next;			
		}
		if (before != NULL) { now->next = before; }
		if (after  != NULL) { now->next = after; }
		return head;
	}
};