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

Merge pull request #1792 from PeterLijunfeng/master

Browse Source 
0704Python版本严格参照C++写法及次序，并追加注释
This commit is contained in:
程序员Carl
2022-12-20 11:01:06 +08:00
committed by GitHub
parent 5c3bcdbbb5 89b2b1cf5e
commit e43183d27f
1 changed files with 19 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -204,18 +204,18 @@ class Solution {
```python
class Solution:
def search(self, nums: List[int], target: int) -> int:
left, right = 0, len(nums) - 1
left, right = 0, len(nums) - 1 # 定义target在左闭右闭的区间里，[left, right]
while left <= right:
middle = (left + right) // 2
middle = left + (right - left) // 2
if nums[middle] < target:
left = middle + 1
elif nums[middle] > target:
right = middle - 1
if nums[middle] > target:
right = middle - 1 # target在左区间，所以[left, middle - 1]
elif nums[middle] < target:
left = middle + 1 # target在右区间，所以[middle + 1, right]
else:
return middle
return -1
return middle # 数组中找到目标值，直接返回下标
return -1 # 未找到目标值
```
（版本二）左闭右开区间
@ -223,18 +223,18 @@ class Solution:
```python
class Solution:
def search(self, nums: List[int], target: int) -> int:
left, right = 0, len(nums)
left, right = 0, len(nums) # 定义target在左闭右开的区间里，即：[left, right)
while left < right:
middle = (left + right) // 2
while left < right: # 因为left == right的时候，在[left, right)是无效的空间，所以使用 <
middle = left + (right - left) // 2
if nums[middle] < target:
left = middle + 1
elif nums[middle] > target:
right = middle
if nums[middle] > target:
right = middle # target 在左区间，在[left, middle)中
elif nums[middle] < target:
left = middle + 1 # target 在右区间，在[middle + 1, right)中
else:
return middle
return -1
return middle # 数组中找到目标值，直接返回下标
return -1 # 未找到目标值
```
**Go：**