BS
| Run Settings | |
|---|---|
| Language | Python |
| Language Version | |
| Run Command |
| Snippet Metadata | |
|---|---|
| Owner | moin778866.ma |
| Created | |
| Modified | |
| Visibility | Public |
# binary search with O(logn)
class Solution:
def search(self, nums: List[int], target: int) -> int:
s, end = 0, len(nums)-1
while s<=end:
mid = s + int((end-s)/2)
if nums[mid] == target:
return mid
elif nums[mid] > target:
end = mid-1
else:
s = mid+1
return -1
| Editor Settings | |
|---|---|
| Theme | |
| Key bindings | |
| Full width | |
| Lines |