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.

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

解决方法：

在正确的位置插入，记录下位置，代码如下：

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