Used isort to sort imports. Also added to the git pre-commit hook.

[python_utils.git] / math_utils.py

diff --git a/math_utils.py b/math_utils.py
index fa0bc0e7bdbbb7789ed56420f17d64b66375cd92..3953ae585d249123c17e82f4a829ad68cf442c0b 100644 (file)
--- a/math_utils.py
+++ b/math_utils.py
@@ -2,11 +2,11 @@
 
 import functools
 import math
+from heapq import heappop, heappush
 from typing import List
-from heapq import heappush, heappop
 
 
-class RunningMedian:
+class RunningMedian(object):
     """A running median computer.
 
     >>> median = RunningMedian()
@@ -39,7 +39,7 @@ class RunningMedian:
 
     def get_median(self):
         if len(self.lowers) == len(self.highers):
-            return (-self.lowers[0] + self.highers[0])/2
+            return (-self.lowers[0] + self.highers[0]) / 2
         elif len(self.lowers) > len(self.highers):
             return -self.lowers[0]
         else:
@@ -143,12 +143,12 @@ def is_prime(n: int) -> bool:
 
     # This is checked so that we can skip middle five numbers in below
     # loop
-    if (n % 2 == 0 or n % 3 == 0):
+    if n % 2 == 0 or n % 3 == 0:
         return False
 
     i = 5
     while i * i <= n:
-        if (n % i == 0 or n % (i + 2) == 0):
+        if n % i == 0 or n % (i + 2) == 0:
             return False
         i = i + 6
     return True
@@ -156,4 +156,5 @@ def is_prime(n: int) -> bool:
 
 if __name__ == '__main__':
     import doctest
+
     doctest.testmod()