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.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0
分析：
如果找不到，那么就是binary search后start的位置。
1 public class Solution { 2 /** 3 * param A : an integer sorted array 4 * param target : an integer to be inserted 5 * return : an integer 6 */ 7 public int searchInsert(int[] A, int target) { 8 9 int start = 0; 10 int end = A.length - 1; 11 12 while (start <= end) { 13 int mid = start + (end - start) / 2; 14 if (A[mid] == target) { 15 return mid; 16 } else if (A[mid] < target) { 17 start = mid + 1; 18 } else { 19 end = mid - 1; 20 } 21 } 22 return start; 23 } 24 }
原文：http://www.cnblogs.com/beiyeqingteng/p/5642336.html