reorganize arrays

Author: keon

algorithms/arrays/__init__.py

@@ -0,0 +1,13 @@
+from .delete_nth import *
+from .flatten import *
+from .garage import *
+from .josephus import *
+from .longest_non_repeat import *
+from .merge_intervals import *
+from .missing_ranges import *
+from .move_zeros import *
+from .plus_one import *
+from .rotate import *
+from .summarize_ranges import *
+from .three_sum import *
+from .two_sum import *

arrays/delete_nth.py renamed to algorithms/arrays/delete_nth.py

@@ -26,6 +26,6 @@ def flatten_iter(iterable):
     """
     for element in iterable:
         if isinstance(element, Iterable):
-            yield from flatten(element)
+            yield from flatten_iter(element)
         else:
             yield element

arrays/flatten.py renamed to algorithms/arrays/flatten.py

@@ -10,7 +10,7 @@
 """
 
 
-def longest_non_repeat(string):
+def longest_non_repeat_v1(string):
     """
     Finds the length of the longest substring
     without repeating characters.
@@ -27,7 +27,7 @@ def longest_non_repeat(string):
     return max_len
 
 
-def longest_non_repeat_two(string):
+def longest_non_repeat_v2(string):
     """
     Finds the length of the longest substring
     without repeating characters.

arrays/garage.py renamed to algorithms/arrays/garage.py

@@ -64,7 +64,7 @@ def print_intervals(intervals):
         print("".join(res))
 
 
-def merge_v2(intervals):
+def merge_intervals(intervals):
     """ Merges intervals in the form of list. """
     if intervals is None:
         return None

arrays/josephus_problem.py renamed to algorithms/arrays/josephus.py

@@ -7,7 +7,7 @@
 """
 
 
-def plus_one(digits):
+def plus_one_v1(digits):
     """
     :type digits: List[int]
     :rtype: List[int]