classSolution{publicintpeakIndexInMountainArray(int[] arr){for(int i =0; i < arr.length; i++){if(arr[i]> arr[i +1]){return i;}if(arr[arr.length - i -1]> arr[arr.length - i -2]){return arr.length - i -1;}}return0;}}
题目题目及示例我的题解两头找变化趋势不同的值,可加速。class Solution { public int peakIndexInMountainArray(int[] arr) { for (int i = 0; i < arr.length; i++) { if (arr[i] > arr[i + 1]) { return i; } if (arr[arr