-
Notifications
You must be signed in to change notification settings - Fork 0
/
searchRange.cpp
71 lines (52 loc) · 1.34 KB
/
searchRange.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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
class Solution {
public:
int firstOccu(vector < int > & nums, int size, int target) {
int start = 0;
int end = size - 1;
int mid = start + (end - start) / 2;
int ans = -1;
while (start <= end) {
if (nums[mid] == target) {
ans = mid;
end = mid - 1;
}
if (target > nums[mid]) {
start = mid + 1;
} else {
end = mid - 1;
}
mid = start + (end - start) / 2;
}
return ans;
}
int lastOccu(vector < int > & nums, int size, int target) {
if(size == 2 && target == nums[1]){
return 1;
}
int start = 0;
int end = size - 1;
int mid = start + (end - start) / 2;
int ans = -1;
while (start <= end) {
if (nums[mid] == target) {
ans = mid;
start = mid + 1;
}
else if (target > nums[mid]) {
start = mid + 1;
} else if(target < nums[mid]) {
end = mid - 1;
}
mid = start + (end - start) / 2;
}
return ans;
}
vector < int > searchRange(vector < int > & nums, int target) {
vector<int>newArr;
int first = firstOccu(nums, nums.size(), target);
int second = lastOccu(nums, nums.size(), target);
newArr.push_back(first);
newArr.push_back(second);
return newArr;
}
};