solved: leetcode: binary_search -@iamserda

Author: iamserda

neetcodeio/algostructybeginners/Lv4-BinarySearch/binary_search_leetcode704.py

@@ -0,0 +1,15 @@
+class Solution:
+    def search(self, nums: list[int], target: int) -> int:
+        if nums:
+            left = 0
+            right = len(nums) - 1
+
+            while left <= right:
+                mid = (left + right) // 2
+                if target > nums[mid]:
+                    left = mid + 1
+                elif target < nums[mid]:
+                    right = mid - 1
+                else:
+                    return mid
+        return -1