题目描述:
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.
我们把符合下列属性的数组 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)首先查找到数组A的中间元素,假设该元素的下标为mid;
(2)如果A[mid-1]<A[mid]<A[mid+1],说明A[mid]小于我们要找的“峰”,继续查找mid右边的中间元素,更新mid值;
(3)如果A[mid-1]>A[mid]>A[mid+1],说明A[mid]大于我们要找的“峰”,继续查找mid左边的中间元素,更新mid值;
(4)重复步骤(2)(3),直到A[mid]>A[mid-1]并且A[mid]>A[mid+1],此时的A[mid]就是我们要找的“峰”,结束循环,返回此时的mid值。
实现(C++):
class Solution {
public:
int peakIndexInMountainArray(vector<int>& A) {
int begin=0;
int end=A.size()-1;
int mid=0;
while(begin<=end){
mid=begin+(end-begin)/2;
if(A[mid-1]<A[mid]&&A[mid]<A[mid+1])
begin=mid+1;
else if(A[mid-1]>A[mid]&&A[mid]>A[mid+1])
end=mid-1;
else
break;
}
return mid;
}
};