algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-05 21:19:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add the figure of assembling blocks.

Browse Source 
Update some texts.
This commit is contained in:
krahets
2023-05-31 01:04:40 +08:00
parent 8247a611d7
commit e35e2e31eb
5 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/python/chapter_searching/binary_search_edge.py
View File

@ -7,8 +7,7 @@ Author: Krahets (krahets@163.com)
def binary_search_left_edge(nums: list[int], target: int) -> int:
"""二分查找最左一个元素"""
# 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素
i, j = 0, len(nums) - 1
i, j = 0, len(nums) - 1 # 初始化双闭区间 [0, n-1]
while i <= j:
m = (i + j) // 2 # 计算中点索引 m
if nums[m] < target:
@ -24,8 +23,7 @@ def binary_search_left_edge(nums: list[int], target: int) -> int:
def binary_search_right_edge(nums: list[int], target: int) -> int:
"""二分查找最右一个元素"""
# 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素
i, j = 0, len(nums) - 1
i, j = 0, len(nums) - 1 # 初始化双闭区间 [0, n-1]
while i <= j:
m = (i + j) // 2 # 计算中点索引 m
if nums[m] < target: