题目描述:
输入一个链表,反转链表后,输出新链表的表头。
思路:
设置一个tmp保存head.next,然后每次把head.next往前移了之后就把head.next指向前面的
class ListNode:
def __init__(self,x):
self.val = x
self.next = None
class Solution:
def reverse(self,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