/**主要结合二分查找法
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var searchInsert = function(nums, target) {
if( !target )
{
return 0;
}
var low = 0;
var higth = nums.length - 1;
return bin_sch( nums,low,higth,target);
};
function bin_sch( array, low, high, k){
if ( low <= high){
var mid = parseInt((low + high)/2 );
if (array[mid] == k){
return mid;
}else if ( k < array[mid]){
return bin_sch( array, low, mid-1, k);
}else{
return bin_sch( array, mid+ 1, high, k);
}
}
return low;
}