关注 每天一道编程题 专栏,一起学习进步。
题目
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 that A[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.
分析
题意:给一个先递增后递减的数列,然后找出数列极值所在下标。
算法很简单,无非就是遍历一遍然后判断当前值比前一个值大,比后一个值也大即可。
然而,实现是不够在,更重要的是如何实现的又快又好。
解答
简单实现(O(n))
class Solution {
public int peakIndexInMountainArray(int[] A) {
for(int i=1;i<A.length-1;i++){
if(A[i]>A[i-1]&&A[i]>A[i+1])
return i;
}
return -1;
}
}
去除冗余条件(O(n))
class Solution {
public int peakIndexInMountainArray(int[] A) {
for (int i = 1; i + 1 < A.length; ++i){
if (A[i] > A[i + 1])
return i;
}
// for (int i = A.length - 1; i > 0; --i) if (A[i] > A[i - 1]) return i;
return 0;
}
}
由于我们是正向遍历的,既然数组是升序,那么在满足A[i]>A[i+1]之前,必然满足A[i]>A[i-1],因此可以省略A[i]>A[i-1](逆序遍历则省略A[i]>A[i+1])
二分查找 (O(log n))
class Solution {
public int peakIndexInMountainArray(int[] A) {
int l = 0, r = A.length - 1, m;
while (l < r) {
m = (l + r) / 2;
if (A[m] < A[m + 1])
l = m + 1;
else
r = m;
}
return l;
}
}
更快的方法时黄金比例搜索
算法,有兴趣的读者可以查看最后一个解法