Skip to content

Commit bbacd6f

Browse files
committed
feat: 704 binary search
1 parent dcbc09d commit bbacd6f

File tree

3 files changed

+42
-0
lines changed

3 files changed

+42
-0
lines changed

.gitignore

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -13,3 +13,8 @@
1313
*.iml
1414
*.idea
1515
*out
16+
17+
# Byte-compiled / optimized / DLL files
18+
__pycache__/
19+
*.py[cod]
20+
*$py.class

py/binary_search/binary_search.py

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
from typing import List
2+
3+
4+
class Solution:
5+
def search(self, nums: List[int], target: int) -> int:
6+
left = 0
7+
right = len(nums) - 1
8+
9+
# loop [left, right]
10+
while left <= right:
11+
mid = (left + right) // 2
12+
13+
if nums[mid] == target:
14+
return mid
15+
elif nums[mid] < target:
16+
left = mid + 1
17+
else:
18+
right = mid - 1
19+
20+
return -1
Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
import unittest
2+
3+
from binary_search import Solution
4+
5+
class TestBinarySearch(unittest.TestCase):
6+
def test_binary_search(self):
7+
sol = Solution()
8+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 3), 2)
9+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 6), -1)
10+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 0), -1)
11+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 5), 4)
12+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 1), 0)
13+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 2), 1)
14+
self.assertEqual(sol.search([1, 2, 3, 4, 5], 4), 3)
15+
16+
if __name__ == '__main__':
17+
unittest.main()

0 commit comments

Comments
 (0)