created limit.py in /algorithms/arrays (keon#353)

aig031 · goswami-rahul · commit 2f361dd92e83 · 2018-06-14T01:03:01.000+05:30
* Create top_1.py

* Create trimmean.py

* Rename top_1.py to algorithms/arrays/top_1.py

* Rename trimmean.py to algorithms/arrays/trimmean.py

* Update __init__.py

* Update README.md

* Update README_CN.md

* Update README_CN.md

* Update README_GE.md

* Update README_JP.md

* Update README_KR.md

* Update test_array.py

* Update test_array.py

* Update test_array.py

* Create limit.py

* Update __init__.py

* Update test_array.py

* Update README.md

* Update README_CN.md

* Update README_GE.md

* Update README_JP.md

* Update README_KR.md

* Update test_array.py

* Update limit.py

* Update test_array.py
diff --git a/README.md b/README.md
@@ -60,6 +60,7 @@ If you want to uninstall algorithms, it is as simple as:
     - [flatten](algorithms/arrays/flatten.py)
     - [garage](algorithms/arrays/garage.py)
     - [josephus_problem](algorithms/arrays/josephus.py)
+    - [limit](algorithms/arrays/limit.py)
     - [longest_non_repeat](algorithms/arrays/longest_non_repeat.py/)
     - [max_ones_index](algorithms/arrays/max_ones_index.py)
     - [merge_intervals](algorithms/arrays/merge_intervals.py)
diff --git a/README_CN.md b/README_CN.md
@@ -78,6 +78,7 @@ pip3 uninstall -y algorithms
     - [garage：停车场](algorithms/arrays/garage.py)
     - [josephus_problem: 约瑟夫问题](algorithms/arrays/josephus.py)
     - [max_ones_index](algorithms/arrays/max_ones_index.py)
+    - [limit](algorithms/arrays/limit.py)
     - [longest_non_repeat：最长不重复子串](algorithms/arrays/longest_non_repeat.py/) 
     - [merge_intervals：合并重叠间隔](algorithms/arrays/merge_intervals.py)
     - [missing_ranges：遗失的范围](algorithms/arrays/missing_ranges.py)
diff --git a/README_GE.md b/README_GE.md
@@ -67,6 +67,7 @@ Um das Projekt zu deinstallieren tippen Sie folgendes:
     - [flatten](algorithms/arrays/flatten.py)
     - [garage](algorithms/arrays/garage.py)
     - [josephus_problem](algorithms/arrays/josephus.py)
+    - [limit](algorithms/arrays/limit.py)
     - [longest_non_repeat](algorithms/arrays/longest_non_repeat.py/)
     - [max_ones_index](algorithms/arrays/max_ones_index.py)
     - [merge_intervals](algorithms/arrays/merge_intervals.py)
diff --git a/README_JP.md b/README_JP.md
@@ -61,6 +61,7 @@ if __name__ == "__main__":
     - [flatten](algorithms/arrays/flatten.py)
     - [garage](algorithms/arrays/garage.py)
     - [josephus_problem](algorithms/arrays/josephus.py)
+    - [limit](algorithms/arrays/limit.py)
     - [longest_non_repeat](algorithms/arrays/longest_non_repeat.py/)
     - [max_ones_index](algorithms/arrays/max_ones_index.py)
     - [merge_intervals](algorithms/arrays/merge_intervals.py)
diff --git a/README_KR.md b/README_KR.md
@@ -60,6 +60,7 @@ if __name__ == "__main__":
     - [flatten](algorithms/arrays/flatten.py)
     - [garage](algorithms/arrays/garage.py)
     - [josephus_problem](algorithms/arrays/josephus.py)
+    - [limit](algorithms/arrays/limit.py)
     - [longest_non_repeat](algorithms/arrays/longest_non_repeat.py/)
     - [max_ones_index](algorithms/arrays/max_ones_index.py)
     - [merge_intervals](algorithms/arrays/merge_intervals.py)
diff --git a/algorithms/arrays/__init__.py b/algorithms/arrays/__init__.py
@@ -14,3 +14,4 @@
 from .trimmean import *
 from .top_1 import *
 from .two_sum import *
+from .limit import *
diff --git a/algorithms/arrays/limit.py b/algorithms/arrays/limit.py
@@ -0,0 +1,30 @@
+"""
+Sometimes you need to limit array result to use. Such as you only need the value over
+10 or, you need value under than 100. By use this algorithms, you can limit your array
+to specific value
+
+If array, Min, Max value was given, it returns array that contains values of given array
+which was larger than Min, and lower than Max. You need to give 'unlimit' to use only Min
+or Max.
+
+ex) limit([1,2,3,4,5], None, 3) = [1,2,3]
+
+Complexity = O(n)
+"""
+
+def limit(arr, min_lim = None, max_lim = None):
+    result = []
+    if min_lim == None:
+        for i in arr:
+            if i<= max_lim:
+                result.append(i)
+    elif max_lim == None:
+        for i in arr:
+            if i >= min_lim:
+                result.append(i)
+    else:
+        for i in arr:
+            if i >= min_lim and i <= max_lim:
+                result.append(i)
+
+    return result
diff --git a/tests/test_array.py b/tests/test_array.py
@@ -14,7 +14,8 @@
     two_sum,
     max_ones_index,
     trimmean,
-    top_1
+    top_1,
+    limit
 )
 
 import unittest
@@ -322,6 +323,14 @@ def test_top_1(self):
         self.assertListEqual(top_1([1 , 1, 2, 2, 3]), [1, 2])
         self.assertListEqual(top_1([1, 2, 3, 324, 234, 23, 23, 1, 23, 23]), [23])
 
+class TestLimit(unittest.TestCase):
+    
+    def test_limit(self):
+        self.assertListEqual(limit([1, 2, 3, 4, 5], 2, 4), [2, 3, 4])
+        self.assertListEqual(limit([1, 2, 3, 4, 5], 2), [2, 3, 4, 5])
+        self.assertListEqual(limit([1, 2, 3, 4, 5], None, 4), [1, 2, 3, 4])
+
+        
 
 
 if __name__ == '__main__':
