Let’s call an array A
a mountain if the following properties hold:
A.length >= 3
- There exists some
0 < i < A.length - 1
such thatA[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]
Given an array that is definitely a mountain, return any i
such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]
.
Example 1:
Input: [0,1,0] Output: 1
Example 2:
Input: [0,2,1,0] Output: 1
Note:
3 <= A.length <= 10000
- 0 <= A[i] <= 10^6
- A is a mountain, as defined above.
思路1:从左到右扫描数组,找到 i, 满足 A[i] > A[i-1] && A[i]
class Solution {
public int peakIndexInMountainArray(int[] A) {
return core(A, 0, A.length-1);
}
public int core(int[] A, int start, int end) {
if(start == end) {
return start;
}
int mid = ((end - start) >> 1) + start;
if(A[mid] > A[mid-1] && A[mid] > A[mid+1]) {
return mid;
}
if(A[mid] < A[mid+1]) {
return core(A, mid+1, end);
}
if(A[mid] < A[mid-1]) {
return core(A, start, mid-1);
}
return -1;
}
}