Python中的排序链表

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class SortedLinkedList:
    def __init__(self):
        self.head = None

    def insert(self, val):
        new_node = ListNode(val)
        if not self.head or self.head.val >= val:
            new_node.next = self.head
            self.head = new_node
        else:
            current = self.head
            while current.next and current.next.val < val:
                current = current.next
            new_node.next = current.next
            current.next = new_node

    def print_list(self):
        current = self.head
        while current:
            print(current.val, end=" -> ")
            current = current.next
        print("None")

# 示例使用
sorted_list = SortedLinkedList()
sorted_list.insert(3)
sorted_list.insert(1)
sorted_list.insert(2)
sorted_list.print_list()  # 输出: 1 -> 2 -> 3 -> None