pep8 fix

Author: nickolasteixeira

Python/chapter02/2.1 - Remove Dups/Nick.py

@@ -1,4 +1,7 @@
 #!/usr/bin/python3
+'''
+Remove Dups! Write code to remove duplicates from an unsorted linked list. FOLLOW UP How would you solve this problem if a temporary buffer is not allowed?
+'''
 import unittest
 
 

Python/chapter02/2.7 - Intersection/Nick.py

@@ -1,5 +1,5 @@
 #!/usr/bin/python3
-
+'''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'''
 import unittest
 
 
@@ -27,7 +27,8 @@ def appendNode(self, data, next=None):
     def printMemoryValues(self):
         temp = self.head
         while temp:
-            print('Memory address values: ', hex(id(temp)), ' Values: ', temp.data)
+            print('Memory address values: ', hex(
+                id(temp)), ' Values: ', temp.data)
             temp = temp.next
 
     def findNode(self, value):
@@ -46,29 +47,28 @@ def findLongest(self, l1, l2):
         if not self.head:
             print('No list to iterate')
             return None
-        
+
         l1count, l2count = 0, 0
         temp1, temp2 = l1.head, l2.head
         while temp1:
             l1count += 1
             temp1 = temp1.next
-        
+
         while temp2:
             l2count += 1
             temp2 = temp2.next
-        
+
         if l1count > l2count:
             longest, shortest = l1, l2
         else:
             longest, shortest = l2, l1
         return abs(l1count - l2count), longest, shortest
 
-
     def intersection(self, l1, l2):
         if not l1.head or not l2.head:
             print('No list to iterate -> intersection')
             return None
-       
+
         diff, longest, shortest = self.findLongest(l1, l2)
         temp = longest.head
         for x in range(diff):
@@ -80,10 +80,10 @@ def intersection(self, l1, l2):
                 return temp
             temp = temp.next
             temp2 = temp2.next
-            
+
         return None
-        
-        
+
+
 class Test(unittest.TestCase):
     @classmethod
     def setUpClass(cls):
@@ -103,29 +103,31 @@ def setUpClass(cls):
         cls.k.appendNode(6, node)
         cls.k.printMemoryValues()
 
-
         cls.p = SinglyLinkedList()
         cls.p.appendNode(1)
         cls.p.appendNode(2)
         cls.p.appendNode(5)
         cls.p.appendNode(1000)
         cls.p.appendNode(-22)
         cls.p.printMemoryValues()
+
     @classmethod
     def tearDownClass(cls):
         pass
 
-
     def printStatement(self, interNode):
         if interNode:
-            print('Nodes intersect at address', hex(id(interNode)), ' Value: ',interNode.data)
+            print('Nodes intersect at address', hex(
+                id(interNode)), ' Value: ', interNode.data)
         else:
             print('Nodes do not intersect')
+
     def test1(self):
         interNode = self.l.intersection(self.l, self.k)
         interNode2 = self.l.intersection(self.l, self.p)
         self.printStatement(interNode)
         self.printStatement(interNode2)
 
+
 if __name__ == '__main__':
     unittest.main()