文章目录 题意思路代码 题意 JZ24 反转链表 给定一个单链表的头结点pHead(该头节点是有值的,比如在下图,它的val是1),长度为n,反转该链表后,返回新链表的表头。 思路 代码 class Solution: def ReverseList(self , head: ListNode) -> ListNode: # write code here pre = None while head != None: next = head.next head.next = pre pre = head head = next head = pre return head