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

其实就是c++ stl中lower_bound的实现

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int numsSize = nums.size();
        int low = 0,high = numsSize;
        while(low<high){
            int mid = low + (high-low)/2;
            if(target <= nums[mid]){
                high = mid;
            }else{
                low = mid+1;
            }
        }
        return low;
    }
};