下面的代码用于在给定列表头部的情况下修改链表
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
if head is None or head.next is None:
return head
prev = None
curr = head
while curr:
curr.next, prev, curr = prev, curr, curr.next
return prev
当 curr.next 一开始被分配 prev 时,我们如何分配 curr = curr.next(第三次分配)?
通常,临时变量用于存储 curr.next 的值,我们如何绕过它呢?