35. Search Insert Position（easy） 

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.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

 由於比較簡單 ，vector也有序，也就沒考慮二分之類更快的搜尋了，直接前向遍歷，搜到相等或大於就返回該位置

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