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
题解：简单的二分搜索，直接放代码：
JAVA版本：
1 public int searchInsert(int[] A, int target) { 2 int answer = 0; 3 int front = 0; 4 int end = A.length-1; 5 while(front <= end){ 6 int mid = (front + end)/2; 7 if(A[mid] == target) 8 return mid; 9 if(A[mid] < target) 10 front = mid + 1; 11 else 12 end = mid-1; 13 } 14 return front; 15 }
【leetcode刷提笔记】Search Insert Position
原文：http://www.cnblogs.com/sunshineatnoon/p/4380149.html