搜索插入位置

 1int searchInsert(vector<int>& nums, int target)
 2{
 3    int left = 0, right = nums.size();
 4    while(left < right)
 5    {
 6        int mid = left + (right - left) / 2;
 7        if(nums[mid] < target)
 8            left = mid + 1;
 9        else
10            right = mid;
11    }
12    return left;
13}