LintCode Q35 Reverse Linked List in Python

  • Jinhai ZHOU
  • 3 Minutes
  • 2016年11月24日
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
"""
Definition of ListNode
class ListNode(object):
def __init__(self, val, next=None):
self.val = val
self.next = next
"""
class Solution:
"""
@param head: The first node of the linked list.
@return: You should return the head of the reversed linked list.
Reverse it in-place.
"""
def reverse(self, head):
# write your code here
# None -> head -> next
# None <- head <- next
curt = None
while head is not None:
temp = head.next
head.next = curt
curt = head
head = temp
return curt
知识共享许可协议
本作品采用知识共享署名-相同方式共享 4.0 国际许可协议进行许可。