在一个有序的数组中，查找小于某个数的个数
[1, 2, 3, 4]2// 1
二分查找
let searchInsert = function (arr, x) { let left = 0; let right = arr.length - 1; while (left <= rig...
在一个有序的数组中，查找小于某个数的个数
[1, 2, 3, 4]
2
// 1
二分查找
let searchInsert = function (arr, x) {
let left = 0;
let right = arr.length - 1;
while (left <= right) {
let mid = (left + right) >> 1;
if (arr[mid] === x) {
return mid;
} else if (x < arr[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
}
}
let arr = [1, 2, 3]
console.log(searchInsert(arr, 2))
-
发表于 2020-07-22 13:59
- 阅读 ( 618 )
- 分类：web前端开发
