反转链表 链接到标题 class ListNode(object): def __init__(self, x): self.val = x self.next = None def reverse_list(list_head): if not list_head or not list_head.next: return list_head reverse_node = None node_pre = None node = list_head while node: node_next = node.next if node_next == None: reverse_node = node node.next = node_pre node_pre = node node = node_next return reverse_node node1 = ListNode(10) node2 = ListNode(11) node3 = ListNode(13) node1.next = node2 node2.next = node3 reverse_list(node1) 合并两个排序的链表 链接到标题 class ListNode(object): def __init__(self, x): self.