Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Here are few examples.[1,3,5,6], 5 → 2[1,3,5,6], 2 → 1[1,3,5,6], 7 → 4[1,3,5,6], 0 → 0
O(n) 扫描一遍如果发现是最大值则返回数组长度（最大index＋1）
def searchInsert(self, nums, target): for x in range(len(nums)): if nums[x] < target: continue if nums[x] >= target: return x return len(nums)
O(logn) 二分查找
var searchInsert = function(nums, target) { var l = 0 var r = nums.length-1 while (l <= r){ var m = l + parseInt((r-l)/2) if(nums[m] < target) l = m + 1 else r = m - 1 } return l }
Leetcode 35 Search Insert Position
原文：http://www.cnblogs.com/lilixu/p/4599326.html