Leetcode-35 Search Insert Position

#35.    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

题解：因为题目已经给出数组是排序过的，所以直接遍历数组，找到大于或者等于目标值的那个数组元素下标，直接返回即可，如果目标值大于所有数组中的值，则直接返回数组的size即可。

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();
        
    }
};

Leetcode-35 Search Insert Position

原文：http://www.cnblogs.com/fengxw/p/6082854.html