一、題目
Reverse Linked List
二移宅、解題
單向列表的倒序。
三、嘗試與結(jié)果
三個(gè)指針：
class Solution(object):
def reverseList(self, head):
if head == None:
return None
if head.next == None:
return head
front = head
last = None
mid = None
while front.next != None:
mid = front
front = front.next
mid.next = last
last = mid
front.next = mid
return front
結(jié)果：AC
遞歸：
class Solution(object):
def reverseList(self, head):
if head == None:
return None
if head.next == None:
return head
last = head.next
result = self.reverseList(last)
head.next = None
last.next = head
return result
結(jié)果：AC
