二分查找模板，包括左边界右边界

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

    return -1;
}

int binary(vector<int> nums, int target){
    int n=nums.size();
    int l=0, r=n-1;
    while(l<=r){
        int mid=(l+r)/2;
        if(nums[mid]<target) l=mid+1;;
        else r=mid-1;
    }

    if(l>=n || nums[l]!=target) return -1;

    return l;
}

int binary(vector<int> nums, int target){
    int n=nums.size();
    int l=0, r=n-1;
    while(l<=r){
        int mid=(l+r)/2;
        if(nums[mid]>target) r=mid-1;;
        else l=mid+1;
    }

    if(r<0 || nums[r]!=target) return -1;

    return r;
}