Python 实现单向链表，和单向链表的反转

python 代码解读复制代码class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None

python 代码解读复制代码 first_node = ListNode("A")
 second_node = ListNode("B")
 third_node = ListNode("C")
 first_node.next = second_node
 second_node.next = third_noe

python 代码解读复制代码class Solution:
    def reverse(self, head):
        prev = None
        current = head
        while current:
            middle, current.next = current.next, prev
            prev, current = current, middle
        return prev

python 代码解读复制代码solution = Solution()
result = solution.reverse(first_node)

python 代码解读复制代码print(result.val, result.next.val, result.next.next.val)