1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
size_t lo = 0, hi = nums.size();
while(lo < hi)
{
size_t mid = (lo + hi) / 2;
if(nums[mid] < target)
{
lo = mid + 1;
}else
{
hi = mid;
}
}
return hi;
}
};
|
T(n) : O(logN)
S(n) : O(1)