力扣反转链表
通过迭代
# 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