LeetCode 数组（二）

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.

Example 1:

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

思路:推荐二分法

class Solution {
public:
    int searchInsert(vector& nums, int target) 
    {
        for (int i = 0; i < nums.size(); ++i) 
		{//与目标值进行判断，并不是最优方案
			if (nums[i] >= target) return i;
		}
		return nums.size();    
    }
};