-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathReverseLinkList.py
55 lines (49 loc) · 1.08 KB
/
ReverseLinkList.py
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# coding: utf-8
__author__ = 'devin'
# Definition for singly-linked list.
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head is None:
return head
node = head
p = head.next
node.next = None
while p is not None:
print p.val
temp = p
p = p.next
temp.next = node
node = temp
return node
if __name__ == '__main__':
head = None
p = None
for i in range(4):
if head is None:
head = ListNode(i)
p = head
else:
p.next = ListNode(i)
p = p.next
p = head
nodes = []
while p is not None:
nodes.append(p.val)
p = p.next
print nodes
s = Solution()
head = s.reverseList(head)
p = head
nodes = []
while p is not None:
nodes.append(p.val)
p = p.next
print nodes