Python实现链表倒排（递归法）

一、代码如下

1、倒排函数

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

def reverseList_recursion(head: ListNode, newHead: ListNode) -> ListNode:
    if head is None:
        return None
    
    if head.next is None:
        newHead = head
    else:
        newHead = reverseList_recursion(head.next, newHead)
        head.next.next = head
        head.next = None
    return newHead

2、调用函数

def main():
    # 初始化
    head = ListNode(1)
    p1 = ListNode(2)
    p2 = ListNode(3)
    p3 = ListNode(4)
    p4 = ListNode(5)
    head.next = p1
    p1.next = p2
    p2.next = p3
    p3.next = p4
    newHead = None

    # 调用倒排函数
    result2 = reverseList_recursion(head, newHead)
        
    while result2:
        print(result2.val)
        result2 = result2.next

if __name__ == "__main__":
    main()