标签：
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 l = 0, r = n - 1; 5 6 while(l <= r){ 7 int mid = (l + r)/2; 8 if(A[mid] == target) return mid; 9 if(A[mid] < target) l = mid + 1; 10 if(A[mid] > target) r = mid - 1; 11 } 12 13 return l; 14 } 15 };
Leetcode:Search Insert Position
标签：
原文地址：http://www.cnblogs.com/Kai-Xing/p/4206421.html
