-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_solver.py
54 lines (45 loc) · 1.25 KB
/
test_solver.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
54
import unittest
from solver import ListNode
class TestSolver(unittest.TestCase):
def test_solver_iteratively(self):
# Create nodes
nodes = [
ListNode(4),
ListNode(3),
ListNode(2),
ListNode(1)
]
# Chain the nodes
for i in range(len(nodes)-1):
nodes[i].next = nodes[i+1]
nodes[len(nodes)-1].next = None
# Reverse the list
head = nodes[0]
head.reverseIteratively(head)
# Verify
node = nodes[len(nodes)-1]
for i in range(1,5):
self.assertEqual(node.val, i)
node = node.next
def test_solver_recursively(self):
# Create nodes
nodes = [
ListNode(4),
ListNode(3),
ListNode(2),
ListNode(1)
]
# Chain the nodes
for i in range(len(nodes)-1):
nodes[i].next = nodes[i+1]
nodes[len(nodes)-1].next = None
# Reverse the list
head = nodes[0]
head.reverseRecursively(head)
# Verify
node = nodes[len(nodes)-1]
for i in range(1,5):
self.assertEqual(node.val, i)
node = node.next
if __name__ == "__main__":
unittest.main()