[LeetCode C++] 35. 搜索插入位置

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/search-insert-position/

题目：

方法一：二分查找

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int l=0;
        int r=nums.size()-1;

        while(l<=r){
            int mid = l+ (r-l)/2;
            if(target == nums[mid])
                return mid;
            else if(target<nums[mid])
                r = mid - 1;
            else
                l = mid + 1;
        }

        return l;
    }
};