class Solution {
public int peakIndexInMountainArray(int[] A) {
int ans=0;
int len=A.length;
for(int i=1;i<len-1;++i){
if((A[i]>A[i-1])&&(A[i]>A[i+1])){
ans=i;
break;
}
}
return ans;
}
}