[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.

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

题意：

给定一个有序数组，给定一个指定值，如果这个元素在数组中，找出其下标，如果不在，找到该插入的位置。

思路：

使用STL的lower_bound

代码如下：

class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
if(nums.size() == 0)return 0;
auto iter = lower_bound(nums.begin(), nums.end(), target);
return (iter - nums.begin());
}
};