CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 18:43:59 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix binary search.

Browse Source 
Finetune a figure in intro_to_dp.
This commit is contained in:
krahets
2023-07-01 20:07:21 +08:00
parent d8b2eb1a32
commit 69920a0599
6 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/javascript/chapter_searching/binary_search_edge.js
View File

@@ -38,7 +38,7 @@ function binarySearchRightEdge(nums, target) {
i = m + 1; // 首个大于 target 的元素在区间 [m+1, j] 中
}
}
if (j == nums.length || nums[j] != target) {
if (j < 0 || nums[j] != target) {
return -1; // 未找到目标元素，返回 -1
}
return j;

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

@@ -32,7 +32,7 @@ def binary_search_right_edge(nums: list[int], target: int) -> int:
j = m - 1 # target 在区间 [i, m-1] 中
else:
i = m + 1 # 首个大于 target 的元素在区间 [m+1, j] 中
if j == len(nums) or nums[j] != target:
if j < 0 or nums[j] != target:
return -1 # 未找到目标元素，返回 -1
return j

2
codes/typescript/chapter_searching/binary_search_edge.ts
View File

@@ -36,7 +36,7 @@ function binarySearchRightEdge(nums: number[], target: number): number {
i = m + 1; // 首个大于 target 的元素在区间 [m+1, j] 中
}
}
if (j == nums.length || nums[j] != target) {
if (j < 0 || nums[j] != target) {
return -1; // 未找到目标元素，返回 -1
}
return j;