给你链表的头结点 head ,请将其按 升序 排列并返回 排序后的链表 。
进阶:
你可以在 O(n log n) 时间复杂度和常数级空间复杂度下,对链表进行排序吗?
示例 1:
输入:head = [4,2,1,3]
输出:[1,2,3,4]
代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode sortList(ListNode head) {
return sort(head);
}
public ListNode sort(ListNode head) {
ListNode start=head,slow=head,fast=head,pre=head;
while (fast!=null&&fast.next!=null)//双指针找中点
{
pre=slow;
fast=fast.next.next;
slow=slow.next;
}
if(slow!=start)
{
pre.next=null;
return merge(sort(start),sort(slow));//合并链表
}
return slow;
}
public ListNode merge(ListNode head,ListNode slow) {//将两个链表合并
ListNode dumpy=new ListNode(-1),cur=dumpy;
while (head!=null&&slow!=null)
{
if(head.val<slow.val)
{
dumpy.next=head;
dumpy=dumpy.next;
head=head.next;
dumpy.next=null;
}else {
dumpy.next=slow;
dumpy=dumpy.next;
slow=slow.next;
dumpy.next=null;
}
}
if(head!=null)
dumpy.next=head;
else if(slow!=null)
dumpy.next=slow;
else dumpy.next=null;
return cur.next;
}
}