[C++]LeetCode: 41 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

Anwser 1: Brute Force方法

复杂度： O(N)

Attention:

1. 考虑目标值和数组内值相等的情况

2. 考虑目标值小于数组第一个元素情况

3. 考虑目标值大于数组最后一个值情况

4. 考虑目标值等于数组最后一个值情况。

AC Code:

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        //如何能只遍历一遍就找到位置
        //遍历一遍，如果target比上一个值大，比当前值小，返回index
        //假设数组没有重复值 目标值可能有重复
        
        if(n == 0 ) return 0;
        if(n > 0 && (target <= A[0])) return 0;
        
        
        int tmp = A[0];
        
        for(int i = 1; i < n; i++)
        {
            if(target > A[i])
            {
                tmp = A[i];
            }
            else if( target <= A[i] && target > tmp)
            {
                return i;
            }
        }
        
        if(target > A[n-1])
            return n;
        else if(target == A[n-1])
            return n - 1;
    }
};

Anwser 1: Brute Force方法

复杂度： O(log(n))

思路： 由于数组是已经排序的，所以每次和中间值比较，二分查找。

Attention: 注意考虑上面提到的各种特殊情况。

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