一个翻转链表的题 class Solution: # 返回ListNode def ReverseList(self, pHead): # write code here if not pHead or not pHead.next: return pHead reHead=None while pHead: p=pHead pHead=pHead.next p.next=r...