35. Search Insert Position

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

给定一个target，和有序序列，如果target在序列中，则返回其索引，否则给出当插入target且不改变序列性质时插入的位置（索引）。

思路依然是二分查找，找到就很简单直接返回，没找到，这个时候判断nums[low]和target的关系。

 1     public int searchInsert(int[] nums, int target) {
 2         int low = 0, high = nums.length-1;
 3         while(low<=high){
 4             int mid = (low+high)/2;
 5             if(nums[mid] == target) return mid;
 6             else if(nums[mid] > target) high = mid-1;
 7             else low = mid+1;
 8         }
 9         return low;    
10     }

35. Search Insert Position

原文：http://www.cnblogs.com/wzj4858/p/7668407.html