单链表反转

最新推荐文章于 2025-03-27 16:00:27 发布

原创最新推荐文章于 2025-03-27 16:00:27 发布 · 112 阅读

0 ·

CC 4.0 BY-SA版权

数据结构与算法专栏收录该内容

45 篇文章

订阅专栏

本文详细介绍了使用Python实现链表逆序的过程，包括定义链表节点类、逆序算法及其实现步骤。通过实例演示了从创建链表到逆序显示的完整流程。

# coding: utf-8

class Node(object):

    def __init__(self, data, next=None):
        self.data = data
        self.next = next


def reverserNode(head):
    if head == Node or head.next == None:
        return head
    probe = None
    next = None

    while head != None:
        next = head.next
        head.next = probe
        probe = head
        head = next
    return probe

if __name__ == "__main__":
    head = None
    for i in range(1,6):
        head = Node(i, head)

    liNode = reverserNode(head)
    while liNode != None:
        print liNode.data
        liNode = liNode.next

结束！