algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0704.二分查找.md

Browse Source
This commit is contained in:
changcv2021
2022-09-22 11:49:20 +08:00
committed by GitHub
parent d11cf7b7ee
commit 2253781859
1 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0704.二分查找.md
View File

@ -225,14 +225,13 @@ class Solution:
def search(self, nums: List[int], target: int) -> int: def search(self, nums: List[int], target: int) -> int:
if nums is None or len(nums)==0: if nums is None or len(nums)==0:
return -1 return -1
l=0 l,r=0,len(nums)
r=len(nums)-1 while (l<r):
while (l<=r): m = round(l+(r-l)//2)
m = round(l+(r-l)/2)
if nums[m] == target: if nums[m] == target:
return m return m
elif nums[m] > target: elif nums[m] > target:
r=m-1 r=m
else: else:
l=m+1 l=m+1
return -1 return -1