fix: test_heap, tree/traversal/__init__ (keon#481)

* fix: test_heap, tree/traversal/__init__

* fix a error in longest_non_repeat.py

Author: JKLiang9714

algorithms/arrays/longest_non_repeat.py

@@ -53,14 +53,17 @@ def get_longest_non_repeat_v1(string):
     """
     if string is None:
         return 0
+    sub_string = ''
     temp = []
     max_len = 0
     for i in string:
         if i in temp:
             temp = []
         temp.append(i)
-        max_len = max(max_len, len(temp))
-    return max_len, temp
+        if len(temp) > max_len:
+            max_len = len(temp)
+            sub_string = ''.join(temp)
+    return max_len, sub_string
 
 def get_longest_non_repeat_v2(string):
     """
@@ -71,12 +74,15 @@ def get_longest_non_repeat_v2(string):
     """
     if string is None:
         return 0
+    sub_string = ''
     start, max_len = 0, 0
     used_char = {}
     for index, char in enumerate(string):
         if char in used_char and start <= used_char[char]:
             start = used_char[char] + 1
         else:
-            max_len = max(max_len, index - start + 1)
+            if index - start + 1 > max_len:
+                max_len = index - start + 1
+                sub_string = string[start: index + 1]
         used_char[char] = index
-    return max_len, start
+    return max_len, sub_string

algorithms/tree/traversal/__init__.py

@@ -1,2 +1,3 @@
 from .preorder import *
 from .postorder import *
+from .inorder import *

tests/test_heap.py

@@ -56,11 +56,11 @@ def test_max_sliding_window(self):
 
     def test_k_closest_points(self):
         points = [(1, 0), (2, 3), (5, 2), (1, 1), (2, 8), (10, 2), (-1, 0), (-2, -2)]
-        self.assertEqual([(-1, 0), (1, 0)], k_closest_points.k_closest(points, 2))
-        self.assertEqual([(1, 1), (-1, 0), (1, 0)], k_closest_points.k_closest(points, 3))
-        self.assertEqual([(-2, -2), (1, 1), (1, 0), (-1, 0)], k_closest_points.k_closest(points, 4))
+        self.assertEqual([(-1, 0), (1, 0)], k_closest(points, 2))
+        self.assertEqual([(1, 1), (-1, 0), (1, 0)], k_closest(points, 3))
+        self.assertEqual([(-2, -2), (1, 1), (1, 0), (-1, 0)], k_closest(points, 4))
         self.assertEqual([(10, 2), (2, 8), (5, 2), (-2, -2), (2, 3),
-                          (1, 0), (-1, 0), (1, 1)], k_closest_points.k_closest(points, 8))
+                          (1, 0), (-1, 0), (1, 1)], k_closest(points, 8))
 
 
 if __name__ == "__main__":