无重复数字的升序数组的二分查找,js应该是最简单易懂的了吧
function search(nums, target) {
var start = 0;
var end = nums.length - 1;
var mid = Math.floor(end / 2);
while (start <= end) {
if (nums[mid] === target) {
return mid
} else if (nums[mid] < target) {
start = mid + 1;
} else if (nums[mid] > target) {
end = mid - 1;
}
mid = Math.floor((start + end) / 2);
}
return -1;
}