-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFind_First_and_Last_Occurance.cpp
47 lines (45 loc) · 1.21 KB
/
Find_First_and_Last_Occurance.cpp
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int first = findFirst(nums, target);
int last = findLast(nums, target);
return {first, last};
}
private:
int findFirst(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1;
int first = -1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] == target) {
first = mid;
right = mid - 1;
}
else if (nums[mid] < target) {
left = mid + 1;
}
else {
right = mid - 1;
}
}
return first;
}
int findLast(vector<int>& nums, int target) {
int left = 0, right = nums.size() - 1;
int last = -1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[mid] == target) {
last = mid;
left = mid + 1;
}
else if (nums[mid] < target) {
left = mid + 1;
}
else {
right = mid - 1;
}
}
return last;
}
};