-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
60 lines (55 loc) · 1.47 KB
/
main.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
/**
* // 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 {
int findMaxIndex(MountainArray &mountainArr) {
int n = mountainArr.length();
int l = 1, r = n - 1;
while (l <= r) {
int m = l + (r - l) / 2;
if (mountainArr.get(m - 1) < mountainArr.get(m)) {
l = m + 1;
} else {
r = m - 1;
}
}
return r;
}
public:
int findInMountainArray(int target, MountainArray &mountainArr) {
int h = findMaxIndex(mountainArr);
{
int l = 0, r = h;
while (l <= r) {
int m = l + (r - l) / 2;
int v = mountainArr.get(m);
if (v == target) return m;
if (target < v) {
r = m - 1;
} else {
l = m + 1;
}
}
}
{
int l = h, r = mountainArr.length() - 1;
while (l <= r) {
int m = l + (r - l) / 2;
int v = mountainArr.get(m);
if (v == target) return m;
if (target < v) {
l = m + 1;
} else {
r = m - 1;
}
}
}
return -1;
}
};