[leetcode]

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

class Solution {public:    int searchInsert(int A[], int n, int target) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        int idx = 0;        do{            if (target <= A[0] || n == 0)            {                idx = 0;                break;            }            if (target > A[n-1])            {                idx = n;                break;            }                        int left = 0;            int right = n-1;            int mid = (left + right)/2;                        while (left < right){                if (A[mid] == target)                {                    idx = mid;                    break;                }                else if (A[mid] < target)                {                    left = mid+1;                }                else                    right = mid ;                                mid = (left + right)/2;            }            idx = mid;        }while(false);        return idx;    }};

left = mid+1;

这里需要注意上面一句，不然会出现死循环！！