improve -Wrote the test for top_one algorithm.

Author: phoenix-deb

limit/test.py

@@ -1,5 +1,3 @@
-import unittest
-import pytest
 from .limit import limit_struct
 
 

top-one/test.py

@@ -0,0 +1,9 @@
+from .top_one import top_one
+
+
+class TestTopOne:
+    def test_top_one(self):
+        assert top_one([1, 2, 1, 3, 4, 2, 2, 2]) == ([1, 2], 4)
+        assert top_one([1]) == ([], 1)
+        assert top_one([1, 2]) == ([], 1)
+        assert top_one([]) == ()

top_one.py renamed to top-one/top_one.py

@@ -15,14 +15,17 @@ def top_one(array: list) -> list:
     counter = {}
     max_repeat = 0
 
-    for val in array:
-        if val not in counter:
-            counter[val] = 1
-        else:
-            counter[val] += 1
-            if val not in result:
-                result.append(val)
+    try:
+        for val in array:
+            if val not in counter:
+                counter[val] = 1
+            else:
+                counter[val] += 1
+                if val not in result:
+                    result.append(val)
 
-    max_repeat = max(counter.values())
+        max_repeat = max(counter.values())
 
-    return result, max_repeat
+        return result, max_repeat
+    except ValueError:
+        return ()