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
二分查找，需要注意的细节就是溢出问题，取中间数请保证加法不会造成溢出。见代码：
1 class Solution { 2 public: 3 int searchInsert(int A[], int n, int target) { 4 int begin = 0, end = n; 5 int mid; 6 while (begin < end) { 7 // (begin + end) / 2是有溢出可能的 8 mid = begin + ((end - begin) >> 1); 9 if (A[mid] < target) { 10 begin = mid + 1; 11 } else if (A[mid] > target) { 12 end = mid; 13 } else { 14 break; 15 } 16 } 17 if (begin >= end) { 18 return end; 19 } 20 return mid; 21 } 22 };
Leetcode OJ: Search Insert Position,布布扣,bubuko.com
Leetcode OJ: Search Insert Position
原文：http://www.cnblogs.com/flowerkzj/p/3616560.html