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
这是一个典型的二分法查找的变式，C++实现如下
int searchInsert(vector<int>& nums, int target) { int length=nums.size(); int right=length-1; int left=0; int mid=(left+right)/2; while(left<=right) { if(nums[mid]==target) return mid; if(nums[mid]>target) right=mid-1; else left=mid+1; mid=(left+right)/2; } return left; }
（leetcode题解）Search Insert Position
原文：http://www.cnblogs.com/kiplove/p/6963710.html