leetcode35二分查找并插入

int searchInsert(vector<int>& nums, int target) {
        int l=0;
        int r=nums.size();
        int mid=0;
        while(l<r){
            mid=(l+r)/2;
            if(nums[mid]>target){
                r=mid;
            }else if(nums[mid]<target){
                l=mid+1;
            }else{
                return mid;
            }
        }
        nums.insert(nums.begin()+l,target);
        return l;
    }