-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path34-Search-for-a-Range.cpp
66 lines (64 loc) · 1.7 KB
/
34-Search-for-a-Range.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
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int i, j, mid, start, end, length = nums.size();
vector<int> ans;
for(i = 0, j = length - 1; i <= j; ){
mid = (i + j) / 2;
if(nums[mid] == target){
if(mid == 0 || i == j){
start = mid;
break;
}
else{
if(nums[mid - 1] == target){
j = mid - 1;
}
else{
start = mid;
break;
}
}
}
else if(nums[mid] > target){
j = mid - 1;
}
else{
i = mid + 1;
}
}
if(i > j){
return vector<int>(2, -1);
}
for(i = 0, j = length - 1; i <= j; ){
mid = (i + j) / 2;
if(nums[mid] == target){
if(mid == length - 1 || i == j){
end = mid;
break;
}
else{
if(nums[mid + 1] == target){
i = mid + 1;
}
else{
end = mid;
break;
}
}
}
else if(nums[mid] > target){
j = mid - 1;
}
else{
i = mid + 1;
}
}
if(i > j){
return vector<int>(2, -1);
}
ans.push_back(start);
ans.push_back(end);
return ans;
}
};