-
Notifications
You must be signed in to change notification settings - Fork 1
/
1095-Find-in-Mountain-Array.cs
49 lines (45 loc) · 1.33 KB
/
1095-Find-in-Mountain-Array.cs
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
class Solution {
public int FindInMountainArray(int target, MountainArray mountainArr) {
var n = mountainArr.Length();
// find out the peak of mountain
int l=1, r=n-1;
while(l<r){
var mid = (l+r) >> 1;
int midVal = mountainArr.Get(mid), nextVal = mountainArr.Get(mid+1);
if( midVal < nextVal){
if(midVal == target) return mid;
if(nextVal == target) return mid+1;
l = mid+1;
}
else r = mid;
}
var peak = l;
// search on left of peak
l=0; r=peak;
while(l<r){
var mid = (l+r) >> 1;
var mVal = mountainArr.Get(mid);
if(mVal == target) return mid;
if(mVal > target) r=mid;
else l=mid+1;
}
// search on right side of peak
l=peak; r=n;
while(l<r){
var mid = (l+r) >> 1;
var mVal = mountainArr.Get(mid);
if(mVal == target) return mid;
if(mVal > target) l=mid+1;
else r=mid;
}
return -1;
}
}
/**
* // This is MountainArray's API interface.
* // You should not implement it, or speculate about its implementation
* class MountainArray {
* public int Get(int index) {}
* public int Length() {}
* }
*/