LeetCode 035. Search Insert Position

Search Insert Position

 

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

查找问题，有序数组，很自然使用二分查找，关键是本题不光是要实现查找功能，还需要找出插入的位置。

二分查找运行完之后low指针指向的是大于target的最小的数，high指针指向的是小于target的最大的数！

因此运行完之后，返回low指针即可。

class Solution 
{
public:
    int searchInsert(int A[], int n, int target) 
    {
        int low, high, mid;
        low = 0;
        high = n-1;
        while(low<=high)
        {
            mid = (low+high)/2;
            if(target > A[mid])
                low = mid+1;
            else if(target < A[mid])
                high = mid-1;
            else if(target == A[mid])
                return mid;
        }
        return low;
    }
};