Leercode 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

和34题差不多。

http://blog.csdn.net/accepthjp/article/details/52447635

真的不太想再二分了！

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