【剑指offer】JZ24 反转链表 python

题目

递归

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

def creatlist_tail(lst):
    L = ListNode()
    first_node = L
    for item in lst:
        p = ListNode()
        p.val = item
        L.next = p
        L = p
    return first_node

def show(node:ListNode):
    print(node.val,end=' ')
    if node.next is not None:
        node = show(node.next)

class Solution:
    def ReverseList(self, head: ListNode) -> ListNode:
        # write code here
        if head is None or head.next is None:
            return head
        prehead = Solution.ReverseList(self, head.next)
        head.next.next = head
        head.next = None
        return prehead

if __name__ == '__main__':
    lst = [1,2,3]
    linklist = creatlist_tail(lst)
    show(linklist)
    print()
    solution = Solution()
    show(solution.ReverseList(linklist))

None 1 2 3 
3 2 1 None 

迭代

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

def creatlist_tail(lst):
    L = ListNode()
    first_node = L
    for item in lst:
        p = ListNode()
        p.val = item
        L.next = p
        L = p
    return first_node

def show(node:ListNode):
    print(node.val,end=' ')
    if node.next is not None:
        node = show(node.next)

class Solution:
    def ReverseList(self, head: ListNode) -> ListNode:
        # write code here
        res = None
        while head:
            nextnode = head.next
            head.next = res
            res = head
            head = nextnode
        return res

if __name__ == '__main__':
    lst = [1,2,3]
    linklist = creatlist_tail(lst)
    show(linklist)
    print()
    solution = Solution()
    show(solution.ReverseList(linklist))

None 1 2 3 
3 2 1 None