力扣腾讯反转链表

力扣反转链表


通过迭代

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        if head == None:
            return head
        res = ListNode(head.val)
        head = head.next
        while head:
            stem = ListNode(head.val)
            stem.next = res
            res = stem
            head = head.next
        return res

在这里插入图片描述

版权声明：本文为qq_45153782原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接和本声明。