[Leetcode][Python] 148. Sort List 排序链表

题目大意

题目连接：
Given the head of a linked list, return the list after sorting it in ascending order.
Follow up: Can you sort the linked list in O(n logn) time and O(1) memory (i.e. constant space)?

即：给定链表，递增排序，保证时间复杂度 O(n logn) 以及常数空间复杂度。

解题思路 1：归并排序

该题目需要运用 归并排序 merge sort / 分而治之 divide and conquer的思想。从上而下 split 列表，从下而上 merge 结果。

1. 通过快慢指针，将链表分成两个部分 head2 和 head2 。
2. head1= sortList(head1)
3. head2 = sortList(head2 )
4. merge(head1,head2 )

代码

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def sortList(head) -> ListNode:
        if not head and not head.next:
            return head
        # 2 pointers: slow, fast
        slow, fast = head, head
        while fast.next and fast.next.next:
            slow = slow.next
            fast = fast.next.next
        head1 = head
        head2 = slow.next
        slow.next = None
        head1 = sortList(head1)
        head2 = sortList(head2)
        head = merge(head1,head2)
        return head
        
    def merge(head1,head2):
        if head1 == None:
            return head2
        if head2 == None:
            return head1
        dummy = listNode(0)
        p = dummy
        while head1 and head2:
            if head1.val <= head2.val:
                p.next = head1
                head1 = head1.next
                p = p.next
            if head1.val > head2.val:
                p.next = head2
                head2 = head2.next
                p = p.next
        if head1 == None:
            p.next = head2
        if head2 == None:
            p.next == head1
        return dummy.next

解题思路 2：借助列表和sort()

简单思想，将linkedList存储在一个列表中并且sort()排序列表，遍历该列表的元素，更新linkedList节点的值。

代码

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
def sortList(self, head: ListNode) -> ListNode:
    if not head or not head.next:
        return head

    p = head
    node_list = []
    while head:
        node_list.append(head.val)
        head = head.next

    node_list.sort()
    head = p
    for i in node_list:
        head.val = i
        head = head.next
        
    return p