leetcode之Sort List

这题主要考察将linked list中的所有数形成一个list之后，将list进行排序的过程。可以用快排等来进行。我懒。。。直接拿现成的用了。代码如下：

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def sortList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:
            return head
        if not head.next:
            return head
        list1 = []
        while head:
            list1.append(head.val)
            head = head.next
        list1.sort()
        head = ListNode(list1[0])
        head1 = head
        for i in range(1, len(list1)):
            head1.next = ListNode(list1[i])
            head1 = head1.next
        return head