笔记 leetcode852 mountain 数组 找出最大值的下标

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

• A.length >= 3
• There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]

Given an array that is definitely a mountain, return any i such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1].

Example 1:

Input: [0,1,0]
Output: 1

Example 2:

Input: [0,2,1,0]
Output: 1

  public int peakIndexInMountainArray(int[] A) {
        int l = 1, h = A.length -2;
        while(l < h) {
           int m = ((h - l) >> 1) + l ;
           if(A[m] > A[m + 1] && A[m] > A[m - 1]) return m;
           if(A[m] > A[m -1] && A[m + 1] > A[m]) l = m + 1;
           if(A[m] < A[m -1] && A[m + 1] < A[m]) h = m;
        }
        return l;
    }