题目链接:https://leetcode-cn.com/problems/peak-index-in-a-mountain-array/
题目如下:
class Solution {
public int peakIndexInMountainArray(int[] arr) {
int max=arr[0];
int pos=0;
for(int i=1;i<arr.length;i++)
if(arr[i]>=max) {max=arr[i];pos=i;}
return pos;
}
}