链表排序

初始想法
新建一个空间存放，不断将信息抄入，如果比右端大，在右端新建，比左端小，新建一个并放入链中

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* sortList(ListNode* head) {
        if(head == NULL || head->next == NULL) return head;
        ListNode* out = new ListNode(head->val);
        ListNode* tmp = head->next;
        ListNode* min = out;
        while(tmp != NULL){
            if(tmp->val >= out->val) {
                out->next = new ListNode(tmp->val);
                out = out->next;
                tmp = tmp->next;
            } else if(tmp->val <= min->val) {
                ListNode* tmpX = new ListNode(tmp->val ,min);
                min = tmpX;
                tmp = tmp->next;
            } else {
                ListNode* tmpX = min;
                while(tmpX->next != NULL){
                    if(tmpX->val <= tmp->val && tmpX->next->val >= tmp->val){
                        ListNode* tmpY = new ListNode(tmp->val ,tmpX->next);
                        tmpX->next = tmpY;
                        break;
                    }
                    tmpX = tmpX->next;
                }
                tmp = tmp->next;
            }
        }
        return min;
    }
};

虽然不明白为什么这么搞…
代码贴在这里…

	ListNode* merge(ListNode* leftList, ListNode* rightList)
	{
		ListNode node(-1);
		ListNode* dummpy = &node;
		ListNode* tail = dummpy;
		while (leftList != nullptr && rightList != nullptr) {
			if (leftList->val < rightList->val){
				tail->next = leftList;
				tail = leftList;
				leftList = leftList->next;
			} else {
				tail->next = rightList;
				tail = rightList;
				rightList = rightList->next;
			}
		}
		if (leftList != nullptr){
			tail->next = leftList;
		}
		if (rightList!=nullptr){
			tail->next = rightList;
		}
        return dummpy->next;
	}

    ListNode* sortList(ListNode* head) {
        if(head == nullptr || head->next == nullptr) return head;
        int len = 0;
        ListNode* fast = head,* slow = head;
        while(fast->next != nullptr && fast->next->next != nullptr){
            fast = fast->next->next;
            slow = slow->next;
        }
        ListNode* tmp = slow->next;
        slow->next = nullptr;
        head = sortList(head);
        tmp = sortList(tmp);
        return merge(head,tmp);
    }