mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Merge pull request #1656 from changcv2021/master
更新二分查找0704 python 左闭右开
This commit is contained in:
@ -225,16 +225,15 @@ class Solution:
|
||||
def search(self, nums: List[int], target: int) -> int:
|
||||
if nums is None or len(nums)==0:
|
||||
return -1
|
||||
l=0
|
||||
r=len(nums)-1
|
||||
while (l<=r):
|
||||
m = round(l+(r-l)/2)
|
||||
if nums[m] == target:
|
||||
return m
|
||||
elif nums[m] > target:
|
||||
r=m-1
|
||||
left,right=0,len(nums)
|
||||
while (left<right):
|
||||
middle = round(left+(right-left)//2)
|
||||
if nums[middle] == target:
|
||||
return middle
|
||||
elif nums[middle] > target:
|
||||
right=middle
|
||||
else:
|
||||
l=m+1
|
||||
left=middle+1
|
||||
return -1
|
||||
```
|
||||
|
||||
|
Reference in New Issue
Block a user