algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 06:07:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Refactor the section of bianry search.

Browse Source
This commit is contained in:
krahets
2023-05-21 04:51:32 +08:00
parent 921d87c238
commit c3e7455285
22 changed files with 76 additions and 161 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/javascript/chapter_binary_search/binary_search.js
View File

@ -12,7 +12,7 @@ function binarySearch(nums, target) {
// 循环，当搜索区间为空时跳出（当 i > j 时为空）
while (i <= j) {
// 计算中点索引 m ，使用 parseInt() 向下取整
const m = parseInt((i + j) / 2);
const m = parseInt(i + (j - i) / 2);
if (nums[m] < target)
// 此情况说明 target 在区间 [m+1, j] 中
i = m + 1;
@ -33,7 +33,7 @@ function binarySearchLCRO(nums, target) {
// 循环，当搜索区间为空时跳出（当 i = j 时为空）
while (i < j) {
// 计算中点索引 m ，使用 parseInt() 向下取整
const m = parseInt((i + j) / 2);
const m = parseInt(i + (j - i) / 2);
if (nums[m] < target)
// 此情况说明 target 在区间 [m+1, j) 中
i = m + 1;