LeetCode | 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

思路：

遍历一遍找出第一个大于等于target的数即可。

代码：

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        for(int i = 0; i < n; i++)
        {
            if(A[i] >= target)
            {
                return i;
            }
        }
        
        return n;
    }
};