输入一个链表,反转链表后,输出新链表的表头。
class ListNode:
def __init__(self,x)
self.val = x
self.next = None
class solution:
def reverse(pHead):
if not pHead or not pHead.next:
return pHead
last = None
while pHead:
tmp = pHead.next
pHead.next = last
last=pHead
pHead=tmp
return last