int searchInsert(vector<int>& nums, int target) {

int n = nums.size();

int lhs = 0;

int rhs = n - 1;

for(; lhs <= rhs;) { // 也可以用<, 但是最后需要返回rhs

// int mid = (lhs + rhs) >> 1;

int mid = lhs + ((rhs - lhs) >> 1);

if(target < nums[mid]) {

rhs = mid - 1;

} else if (target > nums[mid]) {

lhs = mid + 1;

} else {

return mid;

}

}

/*

*/

return rhs + 1;

}