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(vector<int>& nums, int target) {
        if(nums.size() == 0) return -1;
        
        for(int i = 0;i<nums.size();i++){
            if(nums[i]==target||nums[i] > target){
                return i;
            }
        }
        
        return nums.size();
    }
};

35. Search Insert Position