画解算法 704-二分查找 about blog

[Adnios]

打卡C++，二分查找
class Solution { public: int search(vector<int>& nums, int target) { int left=0; int right=nums.size()-1; while(left<=right){ int mid=(left+right)/2; if(nums[mid]==target){ return mid; } else if(nums[mid]<target){ left=mid+1; } else{ right=mid-1; } } return -1; } };

[dljgs1]

python:
Runtime: 36 ms, faster than 99.76% of Python3 online submissions for Binary Search.
Memory Usage: 14.1 MB, less than 40.08% of Python3 online submissions for Binary Search.

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