# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
prev = None # 初始化前一个结点为None
curr = head # 当前节点为head
while curr:
next_node = curr.next # 保存下一个节点的指针
curr.next = prev # 当前节点指向前一个节点,实现反转
prev = curr # 前一个节点右移
curr = next_node # 当前节点右移
return prev # 返回反转后的头节点
06-18
97
03-16
1225