友情提示:画草稿,看题解,打好基础,能解决99%以上的问题!!!
主要思路:归并排序,特殊点在于数据结构为链表。
1.先向下递归找到链表中间节点,再将链表一分为二;
2.向上逐层返回递归,将每个被分割的子链表排序,返回最初的递归,排完两条大链表之后,合并,即为排序后的链表。
class Solution {
public ListNode sortList(ListNode head) {
if(head==null || head.next==null) return head;
ListNode middle = findMiddle(head);
ListNode rightHead = middle.next;
middle.next=null;
ListNode left = sortList(head);
ListNode right = sortList(rightHead);
return mergeList(left,right);
}
private ListNode findMiddle(ListNode head){
if(head==null || head.next==null) return head;
ListNode slow =head;
ListNode fast =head.next.next;
while(fast!=null && fast.next!=null){
slow=slow.next;
fast=fast.next.next;
}
return slow;
}
private ListNode mergeList(ListNode left ,ListNode right){
ListNode dummyHead = new ListNode(-1);
ListNode current = dummyHead;
while(left!=null && right!=null){
if(left.val<right.val){
current.next=left;
left=left.next;
}else{
current.next=right;
right=right.next;
}
//★别忘了让current游标指针后移!!
current=current.next;
}
//★当到了其中一条链表的末尾为null,执行此操作:
current.next=left!=null?left:right;
return dummyHead.next;
}
}