《中英双解》leetCode Peak Index in a Mountain Array 山脉数组的峰顶索引_solution.c: in function ‘peakindexinmountainarray’-CSDN博客

本文链接：https://blog.csdn.net/weixin_46272350/article/details/121802299

该篇博客介绍了如何解决LeetCode上的`Peak Index in a Mountain Array`问题。给定一个确保为山脉数组的整数数组，任务是找到数组中峰值的索引，即数组中从某个点开始连续下降的部分的起始位置。博客提供了一个解决方案，使用了递归的方法寻找左右两侧的最大值，并返回峰值下标。

摘要由CSDN通过智能技术生成

852. Peak Index in a Mountain Array

难度简单223收藏分享切换为中文接收动态反馈

Let's call an array arr a mountain if the following properties hold:

arr.length >= 3
There exists some i with 0 < i < arr.length - 1 such that:
arr[0] < arr[1] < ... arr[i-1] < arr[i]
arr[i] > arr[i+1] > ... > arr[arr.length - 1]

Given an integer array arr that is guaranteed to be a mountain, return any i such that arr[0] < arr[1] < ... arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1].

符合下列属性的数组 arr 称为山脉数组：
arr.length >= 3
存在 i（0 < i < arr.length - 1）使得：
arr[0] < arr[1] < ... arr[i-1] < arr[i]
arr[i] > arr[i+1] > ... > arr[arr.length - 1]
给你由整数组成的山脉数组 arr ，返回任何满足 arr[0] < arr[1] < ... arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1] 的下标 i

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/peak-index-in-a-mountain-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Example 1:
Input: arr = [0,1,0]
Output: 1
Example 2:
Input: arr = [0,2,1,0]
Output: 1
Example 3:
Input: arr = [0,10,5,2]
Output: 1
Example 4:
Input: arr = [3,4,5,1]
Output: 2
Example 5:
Input: arr = [24,69,100,99,79,78,67,36,26,19]
Output: 2
Constraints:

3 <= arr.length <= 104
0 <= arr[i] <= 106
arr is guaranteed to be a mountain array.

数组区域最值问题

class Solution {
    public int peakIndexInMountainArray(int[] arr) {
       int left = 0;
       int right = arr.length - 1;
       int max =  process(arr,left,right);
       int result = 0;
       int i = 0;
       for(;i < arr.length;i++){
           if(arr[i] == max){
               result = i;
               break;
           }
       }
       return i;
    }

    public static int process(int[] arr,int left,int right){
        if(left == right){
           return arr[left];
        }
        int mid = left + ((right - left) >> 1);
        int leftMax = process(arr,left,mid);
        int rightMax = process(arr,mid+1,right);
        return Math.max(leftMax,rightMax);
    }
}