-
Notifications
You must be signed in to change notification settings - Fork 0
/
leetcode34.cpp
44 lines (44 loc) · 885 Bytes
/
leetcode34.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
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int start = 0, end = nums.size(), mid,left,right;
while(start < end)
{
mid = (start + end) / 2;
if(nums[mid] >= target)
{
end = mid;
}
else
{
start = mid + 1;
}
}
left = start; //find the left bound
start = 0;
end = nums.size();
while(start < end)
{
mid = (start + end) / 2;
if(nums[mid] > target)
{
end = mid;
}
else
{
start = mid + 1;
}
}
right = start;
vector<int> res;
if(left == right)
{
res = {-1,-1};
}
else
{
res = {left,right-1};
}
return res;
}
};