forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 1
/
problem_073.py
48 lines (36 loc) · 1.02 KB
/
problem_073.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
class Node:
def __init__(self, x):
self.val = x
self.next = None
def __str__(self):
string = "["
node = self
while node:
string += "{} ->".format(node.val)
node = node.next
string += "None]"
return string
def get_nodes(values):
next_node = None
for value in values[::-1]:
node = Node(value)
node.next = next_node
next_node = node
return next_node
def get_list(head):
node = head
nodes = list()
while node:
nodes.append(node.val)
node = node.next
return nodes
def reverse_list(head, new_head):
if not head:
return new_head
old_head = head.next
head.next = new_head
return reverse_list(old_head, head)
assert not get_list(reverse_list(get_nodes([]), None))
assert get_list(reverse_list(get_nodes([1]), None)) == [1]
assert get_list(reverse_list(get_nodes([1, 2]), None)) == [2, 1]
assert get_list(reverse_list(get_nodes([1, 2, 3]), None)) == [3, 2, 1]