1.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

2.題目要求：搜索插入位置，即找出比當前數字小的數字個數。

3.方法：遍歷一遍原數組，若當前數字大于或等于目標值，則返回當前坐標，如果遍歷結束了，說明目標值比數組中任何一個數都要大，則返回數組長度n即可

4.代碼：
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for (int i = 0; i < nums.size(); ++i) {
if (nums[i] >= target) return i;
}
return nums.size();
}
};