Completed reverse.py

reverse/reverse.py

@@ -18,7 +18,7 @@ def __init__(self):
 
     def add_to_head(self, value):
         node = Node(value)
-
+        
         if self.head is not None:
             node.set_next(self.head)
 
@@ -35,8 +35,19 @@ def contains(self, value):
                 return True
 
             current = current.get_next()
-
         return False
 
-    def reverse_list(self, node, prev):
-        pass
+    def reverse_list(self):
+        if not self.head:
+            return
+
+        current = self.head
+        prev = None
+
+        while current:
+            next_current = current.next_node
+            current.next_node = prev
+            prev = current
+            current = next_current
+
+        self.head = prev

reverse/test_reverse.py

@@ -20,12 +20,12 @@ def test_contains(self):
     self.assertFalse(self.list.contains(1000))
 
   def test_empty_reverse(self):
-    self.list.reverse_list(self.list.head, None)
+    self.list.reverse_list()
     self.assertEqual(self.list.head, None)
 
   def test_single_reverse(self):
     self.list.add_to_head(1)
-    self.list.reverse_list(self.list.head, None)
+    self.list.reverse_list()
     self.assertEqual(self.list.head.value, 1)
 
   def test_longer_reverse(self):
@@ -35,7 +35,7 @@ def test_longer_reverse(self):
     self.list.add_to_head(4)
     self.list.add_to_head(5)
     self.assertEqual(self.list.head.value, 5)
-    self.list.reverse_list(self.list.head, None)
+    self.list.reverse_list()
     self.assertEqual(self.list.head.value, 1)
     self.assertEqual(self.list.head.get_next().value, 2)
     self.assertEqual(self.list.head.get_next().get_next().value, 3)