Sort List

1,  Separate the link list into 2 part. 

2,  recursion to the end.

3, Merge the list

易错点： 1. 判断循环结束 ， 要用 while (fast.next != null && fast.next.next != null)

2. slow.next = null,  一点要断开原来的链表， 否则容易有循环

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode sortList(ListNode head) {
        if(head == null || head.next == null)
            return head;
        ListNode slow = head;
        ListNode fast = head;
        while(fast.next != null && fast.next.next != null){// Really important, because if the link list is less than 3 nodes, fast is the slow.next;
            slow = slow.next;
            fast = fast.next.next;
        }
        fast = slow.next;
        slow.next = null;
        slow = sortList(head);
        fast = sortList(fast);
        return merge(slow, fast);
    }
    
    private ListNode merge(ListNode l1, ListNode l2){
        ListNode newHead = new ListNode(0);
        ListNode cur = newHead;
        while(l1 != null && l2 != null){
            if(l1.val < l2.val){
                cur.next = l1;
                l1 = l1.next;
            }else{
                cur.next = l2;
                l2 = l2.next;
            }
            cur = cur.next;
            cur.next = null;
        }
        if(l1 == null){
            cur.next = l2;
        }else{
            cur.next = l1;
        }
        return newHead.next;
    }
}