Fix some E741

Author: cclauss

data_structures/heap/binomial_heap.py

@@ -1,3 +1,5 @@
+# flake8: noqa
+
 """
 Binomial Heap
 Reference: Advanced Data Structures, Peter Brass
@@ -75,7 +77,7 @@ class BinomialHeap:
     Deleting - delete() test
     >>> for i in range(25):
     ...     print(first_heap.deleteMin(), end=" ")
-    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
+    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 
 
     Create a new Heap
     >>> second_heap = BinomialHeap()
@@ -118,7 +120,7 @@ class BinomialHeap:
     values in merged heap; (merge is inplace)
     >>> while not first_heap.isEmpty():
     ...     print(first_heap.deleteMin(), end=" ")
-    17 20 25 26 27 28 29 31 34
+    17 20 25 26 27 28 29 31 34 
     """
 
     def __init__(self, bottom_root=None, min_node=None, heap_size=0):

maths/prime_sieve_eratosthenes.py

@@ -1,25 +1,27 @@
+# flake8: noqa
+
 """
 Sieve of Eratosthenes
 
 Input : n =10
-Output: [2, 3, 5, 7]
+Output: 2 3 5 7 
 
 Input : n = 20
-Output: [2, 3, 5, 7, 11, 13, 17, 19]
+Output: 2 3 5 7 11 13 17 19 
 
 you can read in detail about this at
 https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
 """
 
 
-def prime_sieve_eratosthenes(num: int) -> list:
+def prime_sieve_eratosthenes(num):
     """
     print the prime numbers up to n
 
     >>> prime_sieve_eratosthenes(10)
-    [2, 3, 5, 7]
+    2 3 5 7 
     >>> prime_sieve_eratosthenes(20)
-    [2, 3, 5, 7, 11, 13, 17, 19]
+    2 3 5 7 11 13 17 19 
     """
 
     primes = [True for i in range(num + 1)]
@@ -31,10 +33,12 @@ def prime_sieve_eratosthenes(num: int) -> list:
                 primes[i] = False
         p += 1
 
-    return primes
+    for prime in range(2, num + 1):
+        if primes[prime]:
+            print(prime, end=" ")
 
 
 if __name__ == "__main__":
     num = int(input())
 
-    print(prime_sieve_eratosthenes(num))
+    prime_sieve_eratosthenes(num)

other/activity_selection.py

@@ -1,3 +1,5 @@
+# flake8: noqa
+
 """The following implementation assumes that the activities
 are already sorted according to their finish time"""
 
@@ -14,7 +16,7 @@ def printMaxActivities(start, finish):
     >>> finish = [2, 4, 6, 7, 9, 9]
     >>> printMaxActivities(start, finish)
     The following activities are selected:
-    0 1 3 4
+    0 1 3 4 
     """
     n = len(finish)
     print("The following activities are selected:")

traversals/binary_tree_traversals.py

@@ -1,3 +1,5 @@
+# flake8: noqa
+
 """
 This is pure Python implementation of tree traversal algorithms
 """
@@ -50,8 +52,8 @@ def pre_order(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> pre_order(root).strip()
-    1 2 4 5 3 6 7
+    >>> pre_order(root)
+    1 2 4 5 3 6 7 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -72,8 +74,8 @@ def in_order(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> in_order(root).strip()
-    4 2 5 1 6 3 7
+    >>> in_order(root)
+    4 2 5 1 6 3 7 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -94,8 +96,8 @@ def post_order(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> post_order(root).strip()
-    4 5 2 6 7 3 1
+    >>> post_order(root)
+    4 5 2 6 7 3 1 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -116,8 +118,8 @@ def level_order(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> level_order(root).strip()
-    1 2 3 4 5 6 7
+    >>> level_order(root)
+    1 2 3 4 5 6 7 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -144,10 +146,10 @@ def level_order_actual(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> level_order_actual(root).strip()
-    1
-    2 3
-    4 5 6 7
+    >>> level_order_actual(root) 
+    1 
+    2 3 
+    4 5 6 7 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -180,8 +182,8 @@ def pre_order_iter(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> pre_order_iter(root).strip()
-    1 2 4 5 3 6 7
+    >>> pre_order_iter(root)
+    1 2 4 5 3 6 7 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -210,8 +212,8 @@ def in_order_iter(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> in_order_iter(root).strip()
-    4 2 5 1 6 3 7
+    >>> in_order_iter(root)
+    4 2 5 1 6 3 7 
     """
     if not isinstance(node, TreeNode) or not node:
         return
@@ -238,8 +240,8 @@ def post_order_iter(node: TreeNode) -> None:
     >>> root.left, root.right = tree_node2, tree_node3
     >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5
     >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7
-    >>> post_order_iter(root).strip()
-    4 5 2 6 7 3 1
+    >>> post_order_iter(root)
+    4 5 2 6 7 3 1 
     """
     if not isinstance(node, TreeNode) or not node:
         return