python算法习题（三）： 链表反置

版权声明：本文为博主原创文章，欢迎转载，但请注明原文出处。 https://blog.csdn.net/GiveMeFive_Y/article/details/79746513

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

构造链表：

def makeLinkList(num):
    head = None
    for i in range(num):
        tmp = Node(i)
        if head:
            tmp.next = head
        head = tmp
    return head

head = makeLinkList(10)

N1 = head
while N1:
    print(N1.data, end=" ")   # 9 8 7 6 5 4 3 2 1 0 
    N1 = N1.next

def reverseLinkList(head):
    new_head = None
    while head:
        current = head
        head = head.next
        current.next = new_head
        new_head = current
    return new_head

N2 = reverseLinkList(head)
while N2:
    print(N2.data, end=" ")  # 0 1 2 3 4 5 6 7 8 9
    N2 = N2.next