LeetCode BinarySearch 852. Peak Index in a Mountain Array 1095. Find in Mountain Array

852. Peak Index in a Mountain Array

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

1. A.length >= 3
2. 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

Note:
3 <= A.length <= 10000
0 <= A[i] <= 10^6
A is a mountain, as defined above.

solution

和162 find peak element的思路一致，采用二分法模板。当前一个数大于后一个数，说明处于下降段，hi = mid；当前一个数小于后一个数，说明处于上升段，lo = mid。

    public int peakIndexInMountainArray(int[] A) {
        int lo = 0;
        int hi = A.length - 1;
        
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2;
            if (A[mid] > A[mid + 1]) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        return (A[lo] > A[hi]) ? lo : hi;
    }

1095. Find in Mountain Array

You may recall that an array A is a mountain array if and only if:

1. A.length >= 3
2. There exists some i with 0 < i < A.length - 1 such that:
   A[0] < A[1] < … A[i-1] < A[i]
   A[i] > A[i+1] > … > A[A.length - 1]
   Given a mountain array mountainArr, return the minimum index such that mountainArr.get(index) == target. If such an index doesn’t exist, return -1.

You can’t access the mountain array directly. You may only access the array using a MountainArray interface:

1. MountainArray.get(k) returns the element of the array at index k (0-indexed).
2. MountainArray.length() returns the length of the array.

Submissions making more than 100 calls to MountainArray.get will be judged Wrong Answer. Also, any solutions that attempt to circumvent the judge will result in disqualification.

Example 1:
Input: array = [1,2,3,4,5,3,1], target = 3
Output: 2
Explanation: 3 exists in the array, at index=2 and index=5. Return the minimum index, which is 2.

Example 2:
Input: array = [0,1,2,4,2,1], target = 3
Output: -1
Explanation: 3 does not exist in the array, so we return -1.

Constraints:

1. 3 <= mountain_arr.length() <= 10000
2. 0 <= target <= 10^9
3. 0 <= mountain_arr.get(index) <= 10^9

solution binary search

首先binary search确定peak位置，
然后两个binary search分别在peak左右search

    public int findInMountainArray(int target, MountainArray mountainArr) {
        int lo = 0;
        int hi = mountainArr.length() - 1;
        
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2;
            if (mountainArr.get(mid) > mountainArr.get(mid + 1)) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        
        int peak = (mountainArr.get(lo) > mountainArr.get(hi)) ? lo : hi;
        // we can actually search target at the left half and right half
        lo = 0;
        hi = peak;
        
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2;
            if (mountainArr.get(mid) > target) {
                hi = mid;
            } else if (mountainArr.get(mid) < target) {
                lo = mid;
            } else if (mountainArr.get(mid) == target) {
                return mid;
            } 
        }
        
        if (mountainArr.get(lo) == target) {
            return lo;
        }
        if (mountainArr.get(hi) == target) {
            return hi;
        }
        
        lo = peak;
        hi = mountainArr.length() - 1;
        
        while (lo + 1 < hi) {
            int mid = lo + (hi - lo) / 2;
            if (mountainArr.get(mid) > target) {
                lo = mid;
            } else if (mountainArr.get(mid) < target) {
                hi = mid;
            } else if (mountainArr.get(mid) == target) {
                return mid;
            } 
        }
        
        if (mountainArr.get(lo) == target) {
            return lo;
        }
        if (mountainArr.get(hi) == target) {
            return hi;
        }
        
        return -1;
    }