C++整数二分法

#include <iostream>
using namespace std;

int check(int mid) {
    return mid;
}

int bsearch_1(int l, int r) {
    while(l < r) {
        // 如果是r = mid的话则不需要加1
        int mid = (l + r) / 2;
        if(check(mid)) {
            r = mid;
        }else {
            l = mid + 1;
        }
    }
}

int bsearch_2(int l, int r) {
    while(l < r) {
        // 如果是l = mid的话则需要加1
        int mid = (l + r +  1) / 2;
        if(check(mid)) {
            l = mid;
        }else {
            r = mid - 1;
        }
    }
}
int main()
{





    return 0;
}