L852山脉数组的峰顶索引
GitHub 账户:LuvnJoae 欢迎关注! https://github.com/LuvnJoae
GitHub 代码链接:https://github.com/LuvnJoae/Java_leetcode
思路和结果
代码思路1
package Day13_5_31.L852;
/**
* 思路1
1. 题目给的数组就是山脉数组,所以直接找出最大值就好了
*/
public class Solution {
public int peakIndexInMountainArray(int[] A) {
int max = A[0];
int index = 0;
for (int i = 0; i < A.length; i++) {
if ( max < A[i]){
max = A[i];
if (max > A[i+1]){
index = i;
}
}
}
return index;
}
}
代码思路2
package Day13_5_31.L852;
/**
* 思路2
1. 和一思路一样,代码简便了一点而已
*/
public class Solution2 {
public int peakIndexInMountainArray(int[] A) {
int index=0;
for(int i=0;i < A.length;i++){
if(A[i]<A[i+1])
index=i+1;
else return index;
}
return 0;
}
}