题解 | #反转链表#
反转链表
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 a = ListNode(0) a.next = pHead p = pHead.next pHead.next=None while(p!=None): q=p.next p.next=a.next a.next=p p=q return a.next
投递网易有道等公司10个岗位 >
腾讯二面453人在聊