-
Notifications
You must be signed in to change notification settings - Fork 0
/
leet1095.c++
62 lines (53 loc) · 1.49 KB
/
leet1095.c++
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
/**
* // This is the MountainArray's API interface.
* // You should not implement it, or speculate about its implementation
* class MountainArray {
* public:
* int get(int index);
* int length();
* };
*/
class Solution {
public:
int findInMountainArray(int target, MountainArray &mountainArr) {
int start = 0;
int end = mountainArr.length() - 1;
//finding the peak
while (start < end){
int mid = start + (end - start) / 2;
if (mountainArr.get(mid) > mountainArr.get(mid + 1)){
end = mid;
}
else{
start = mid + 1;
}
}
int peak = start;
start = 0;
end = peak;
std::cout << peak << std::endl;
while (start <= end){
int mid = start +(end - start) / 2;
if (mountainArr.get(mid) == target){
return mid;
}else if(mountainArr.get(mid) < target){
start = mid + 1;
}else{
end = mid - 1;
}
}
start = peak;
end = mountainArr.length() - 1;
while (start <= end){
int mid = start +(end - start) / 2;
if (mountainArr.get(mid) == target){
return mid;
}else if(mountainArr.get(mid) < target){
end = mid - 1;
}else{
start = mid + 1;
}
}
return -1;
}
};