classSolution:defreverseList(self, head: ListNode)-> ListNode:
cur = head
pre =Nonewhile cur:
nex = cur.next
cur.next= pre
pre = cur
cur = nex
return pre
Leetcode206. 反转链表反转一个单链表。示例:输入: 1->2->3->4->5->NULL输出: 5->4->3->2->1->NULL代码(迭代):class Solution: def reverseList(self, head: ListNode) -> ListNode: cur = head pre = None while cur: