blob: 7f5f989a170ac43231ff5452f9ea894419877d98 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include "leetcode.h"
class Solution {
public:
vector<int> searchRange(vector<int> &nums, int target) {
int tLeft = find(target, nums);
if (tLeft == nums.size() || nums[tLeft] != target)
return {-1, -1};
return {tLeft, find(target + 1, nums, tLeft) - 1};
}
int find(int target, vector<int> arr, int left = 0) {
int right = arr.size() - 1;
while (left <= right) {
int mid = left + right >> 1;
if (arr[mid] < target)
left = mid + 1;
else
right = mid - 1;
}
return left;
}
};
|