formatting

Author: sloloris

chapter-2-linked-lists/2.5-sum-lists.py

@@ -8,6 +8,24 @@
 Input: (6 -> 1 -> 7) + (2 -> 9 -> 5). That is, 617 + 295.
 Output: 9 -> 1 -> 2. That is, 912.
 """
+from LL_implementation import LLNode, LinkedList
+
+# Can you assume both numbers have the same number of digits?
+
+def sum_lists(ll1,ll2):
+    node1 = ll1.head
+    node2 = ll2.head
+    list_sum = 0
+    digit = 0.1
+    while node1:
+        digit *= 10
+        list_sum += (node1.data + node2.data) * digit
+        node1 = node1.next
+        node2 = node2.next
+    while list_sum > 0:
+        remainder = list_sum % digit
+        
+
 
 
 

chapter-2-linked-lists/2.6-palindrome.py

@@ -1,5 +1,6 @@
 """ 2.6 Palindrome: Implement a function to check if a linked list is a palindrome. """
 
+from LL_implementation import LLNode, LinkedList
 
 
 

chapter-2-linked-lists/2.7-intersection.py

@@ -1,5 +1,6 @@
 """ 2.7 Intersection: Given two (singly) linked lists, determine if the two lists intersect. Return the intersecting node. Note that the intersection is defined based on reference, not value. That is, if the kth node of the first linked list is the exact same node (by reference) as the jth node of the second linked list, then they are intersecting. """
 
+from LL_implementation import LLNode, LinkedList
 
 
 

chapter-2-linked-lists/2.8-loop-detection.py

@@ -8,6 +8,7 @@
 
 """
 
+from LL_implementation import LLNode, LinkedList
 
 
 

chapter-2-linked-lists/LL_implementation.py

@@ -43,6 +43,7 @@ def add(self, node_data):
 
     def remove(self, node_data):
         current = self.head
+        previous = None
         while current.data != node_data:
             previous = current
             current = current.next