#!/usr/bin/python
# -*- utf-8 -*-

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

class Solution:
    # @param head, a ListNode
    # @return a ListNode
    def insertionSortList(self, head):
        # Todo
        return head


if __name__ == '__main__':
    from leetcode import ListNode
    Solution().insertionSortList(ListNode.new(1, 9, 8, 7, 6, 5, 4, 3, 2, 0)).print()
#!/usr/bin/python
# -*- utf-8 -*-

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

class Solution:
    # @param head, a ListNode
    # @return a ListNode
    def insertionSortList(self, head):
        # Todo
        return head


if __name__ == '__main__':
    from leetcode import ListNode
    Solution().insertionSortList(ListNode.new(1, 9, 8, 7, 6, 5, 4, 3, 2, 0)).print()
#!/usr/bin/python # -*- utf-8 -*- # Definition for singly-linked list. # class ListNode: #     def __init__(self, x): #         self.val = x #         self.next = None # @param head, a ListNode # @return a ListNode # Todo