NC70 单链表的排序

方法2应该是对的但是时间爆炸了。。。。时间复杂度太高了

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
# @param head ListNode类 the head node
# @return ListNode类
class Solution:
    def sortInList(self , head: ListNode) -> ListNode:
    # write code here
    #方法3（递归，对半递归），归并排序
        if head == None or head.next == None:
            return head
        left = head
        mid = head.next
        right = head.next.next
        #寻找中间节点
        while right and right.next:
            left = left.next
            mid = mid.next
            right = right.next.next
        left.next = None#断开链表
        return self.merge(self.sortInList(head),self.sortInList(mid))
    def merge(self,pHead1:ListNode,pHead2:ListNode):
        if pHead1 == None:
            return pHead2
        if pHead2 == None:
            return pHead1
        #新建一个链表
        head = ListNode(0)
        cur = head
        while pHead1 and pHead2:
            if pHead1.val <= pHead2.val:
                cur.next = pHead1
                #移动取值的指针
                pHead1 = pHead1.next
            else:
                cur.next = pHead2
                pHead2 = pHead2.next
            cur = cur.next
        if pHead1:
            cur.next = pHead1
        else:
            cur.next = pHead2 
        #返回值
        return head.next


        #方法2:递归(是对的，时间复杂太高)
        if head.next == None:
            return head
        head.next = self.sortInList(head.next)
        temp = head.next#排好序的链表头
        result = head.next
        if head.val < head.next.val:
            return head
        while temp != None:
            if temp.next and head.val>temp.val and head.val<temp.next.val:
                head.next = temp.next
                temp.next = head
                break
            elif temp.next == None:
                temp.next = head
                head.next = None
                # break
            else:
                temp = temp.next
        return result


        # 方法1：辅助数组
        temp = []
        while head:
            temp.append(head.val)
            head = head.next
        temp.sort()
        result = ListNode(-1)#头节点
        temp1 = result
        for i in temp:
            temp1.next = ListNode(i)
            temp1 = temp1.next
        return result.next