python单链表反转的方法是什么

995
2023/12/4 19:42:53
栏目: 编程语言
开发者测试专用服务器限时活动,0元免费领,库存有限,领完即止! 点击查看>>

Python中单链表的反转可以通过迭代或递归实现。

  1. 迭代法:

    def reverseList(head):
        prev = None
        current = head
        while current:
            next_node = current.next
            current.next = prev
            prev = current
            current = next_node
        return prev
    
  2. 递归法:

    def reverseList(head):
        if not head or not head.next:
            return head
        new_head = reverseList(head.next)
        head.next.next = head
        head.next = None
        return new_head
    

以上两种方法都会返回反转后的链表的头节点。

辰迅云「云服务器」,即开即用、新一代英特尔至强铂金CPU、三副本存储NVMe SSD云盘,价格低至29元/月。点击查看>>

推荐阅读: python迭代算法怎么实现