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

s思路：
1. 还是binary search，需要找大于等于target的最小值的位置！

//恭喜！一次通过OJ.
class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        //
        int left=0,right=nums.size()-1;
        while(left<=right){
            int mid=left+(right-left)/2;
            if(nums[mid]==target) return mid;
            if(nums[mid]>target){
                right=mid-1;
            }else
                left=mid+1;    
        }
        return left;//执行到这一步，一定是没找到nums[mid]==target
        //最后一次一定是left==right==mid,且nums[mid]<target,left++，
        //所以这个位置就是应该插入的位置！
    }
};