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

很简单，没的说。

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

leetcode 35 Search Insert Position(二分法)

原文：http://www.cnblogs.com/zywscq/p/5216205.html