1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
| #include <vector>
using std::vector;
class Solution {
public:
int searchInsert(vector<int> &nums, int target)
{
int left = 0, right = nums.size() - 1;
int mid = 0;
while (left <= right) {
mid = (left + right) / 2;
if (nums[mid] == target) {
return mid;
} else if (nums[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
if (nums[mid] > target) {
return mid;
} else {
return mid + 1;
}
}
};
|
