sort list（归并排序）

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

    ListNode *sortList(ListNode *head) {
        if(head==NULL || head->next==NULL)
            return head;
        ListNode *middle=findmiddle(head);
        ListNode *right=sortList(middle->next);
        middle->next=NULL;
        ListNode *left=sortList(head);
        ListNode *newHead=mergetwoList(left,right);
        return newHead;
    }
    ListNode *findmiddle(ListNode *head)
    {
        ListNode *p1=head;
        ListNode *p2=head->next;//中间偏钱的那个数字；因为如果是两个数字，好比3 2，二分之后，left是3 2，right 是空的，那么mergetwoList就不对了。所以需要靠前便的数字
        while(p2 && p2->next)
        {
            p2=p2->next->next;
            p1=p1->next;
        }
        return p1;
    }
    ListNode *mergetwoList(ListNode *left,ListNode *right)
    {
        if(left==NULL)
            return right;
        if(right==NULL)
            return left;
        ListNode *newHead=new ListNode(0);
        ListNode *p=newHead;
        while(left && right)
        {
            if(left->val <right->val)
            {
                p->next=left;
                left=left->next;
            }
            else
            {
                p->next=right;
                right=right->next;
            }
            p=p->next;
        }
        if(left)
            p->next=left;
        else
            p->next=right;
        return newHead->next;
    }
};