我们把符合下列属性的数组 A
称作山脉:
A.length >= 3
- 存在
0 < i < A.length - 1
使得A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]
给定一个确定为山脉的数组,返回任何满足 A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]
的 i
的值。
示例 1:
输入:[0,1,0] 输出:1
示例 2:
输入:[0,2,1,0] 输出:1
提示:
3 <= A.length <= 10000
- 0 <= A[i] <= 10^6
- A 是如上定义的山脉
解法1:
思路:穷举求最大值下标
代码实现:
class Solution {
public static int peakIndexInMountainArray(int[] A) {
int maxIndex=0;
for (int i=0;i<A.length;i++)
if (A[maxIndex]<A[i])
maxIndex=i;
return maxIndex;
}
}
解法2:
思路:二分查找
代码实现:
class Solution {
public int peakIndexInMountainArray(int[] A) {
int low = 0;
int high = A.length - 1;
int mid = (low+high)>>2;
while (mid <= high && mid > 0 && mid >= low)
{
if (A[mid]>A[mid-1]&&A[mid]>A[mid+1]) //如果mid为峰值 则返回mid
return mid;
else if (A[mid]<A[mid-1])
high = mid-1;
else if (A[mid] < A[mid+1])
low = mid+1;
mid = (low+high)>>1;
}
return A[mid]>A[mid+1] ? mid : mid+1; //如果mid为峰值 则返回mid否则返回mid+1
}
}