mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-12 21:50:49 +08:00
修改 0704 二分查找 JavaScript版本 左闭右闭区间 解法
This commit is contained in:
@ -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;
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user