二分查找算法
二分查找
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var search = function(nums, target) {
let left = 0;
let right = nums.length-1;
while(left <= right){
let mid = Math.floor((left+right)/2);
i
原创
2021-10-15 18:37:30 ·
53 阅读 ·
0 评论