实现一下 lower_bound 和 upper_bound
测试:https://leetcode-cn.com/problems/search-insert-position/
int my_lower_bound(vector<int> &nums, int target) {
int l = 0, r = nums.size();
int m = -1;
while(l < r) {
m = (l+r)/2;
if(nums[m] < target) {
l = m+1;
}else {
r = m;
}
}
return l;
}
int my_upper_bound(vector<int> &nums, int target) {
int l = 0, r = nums.size();
int m = -1;
while(l < r) {
m = (l+r)/2;
if(nums[m] <= target) {
l = m+1;
}else {
r = m;
}
}
return l;
}