<LeetCode><Easy>206 ReverseLinkedList

Reverse a singly linked list.

#Python2 48ms

class Solution(object):
def reverseList(self, head):
if not head:
return
nodes=[None,head,]
while 1:
if nodes[-1].next:
nodes.append(nodes[-1].next)
nodes[-2].next=nodes[-3]
else:
break
nodes[-1].next=nodes[-2]
return nodes[-1]

#Python2 48ms
class Solution(object):
def reverseList(self, head):
if not head:
return
nodes=[None,head,]
while 1:
if nodes[-1].next:
nodes.append(nodes[-1].next)
else:
break
for i in xrange(1,len(nodes)):
nodes[i].next=nodes[i-1]
return nodes[-1]