35. Search Insert Position

思路：
直接二分查找即可。
代码：

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

35. Search Insert Position

原文：https://www.cnblogs.com/Mrsdwang/p/14702281.html