问题 https://leetcode-cn.com/problems/search-insert-position/
练习使用JavaScript解答
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var searchInsert = function(nums, target) {
var beg=0, end=nums.length-1, mid;
if(target <= nums[beg])
return beg;
if(target > nums[end])
return end+1;
while(beg <= end) {
mid = Math.floor((beg+end)/2);
if(target == nums[mid])
return mid;
if(target > nums[mid])
beg = mid+1;
else
end = mid-1;
}
for(mid = beg-2;mid !=nums.length;++mid)
if(nums[mid] > target)
return mid;
};