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

Merge pull request #792 from Jerry-306/patch-20

Browse Source 
修改 0704 二分查找 JavaScript版本 左闭右闭区间 解法
This commit is contained in:
程序员Carl
2021-09-29 10:41:40 +08:00
committed by GitHub
parent a6088470c3 7f75ee1b56
commit 93a40f952f
1 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -288,15 +288,16 @@ func search(nums []int, target int) int {
* @param {number} target * @param {number} target
* @return {number} * @return {number}
*/ */
/**
var search = function(nums, target) { var search = function(nums, target) {
let left = 0, right = nums.length; let left = 0, right = nums.length - 1;
// 使用左闭右开区间 [left, right) // 使用左闭右闭区间
while (left < right) { while (left <= right) {
let mid = left + Math.floor((right - left)/2); let mid = left + Math.floor((right - left)/2);
if (nums[mid] > target) { if (nums[mid] > target) {
right = mid; // 去左区间寻找 right = mid - 1; // 去左面闭区间寻找
} else if (nums[mid] < target) { } else if (nums[mid] < target) {
left = mid + 1; // 去右区间寻找 left = mid + 1; // 去右面闭区间寻找
} else { } else {
return mid; return mid;
} }