题解 | #反转链表#
反转链表
http://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
-- coding:utf-8 --
class ListNode:
def init(self, x):
self.val = x
self.next = None
class Solution: # 返回ListNode def ReverseList(self, pHead): # write code here if pHead == None: return pHead if pHead.next == None: return pHead pre = None now = pHead
nxt = now.next
while now:
nxt = now.next
now.next = pre
pre = now
now = nxt
return pre
度是白月光
