35. Search Insert Position

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

    }
};