LeetCode：1095. Find in Mountain Array

(This problem is an interactive problem.)

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

• A.length >= 3
• 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:

• MountainArray.get(k) returns the element of the array at index k (0-indexed).
• 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

思路：二分查找找到封顶，然后二分查找最左边到封顶，如果没有，则二分查找封顶到最右边。

class Solution {
public:
    int findInMountainArray(int target, MountainArray &mountainArr) {
        int high = 0;
        int len = mountainArr.length();
        int left = 0, right = len-1;
        while(left <= right){
            int mid = left+(right-left) / 2;
            int val = mountainArr.get(mid);
            
            if(mid ==0){ left = mid+1;continue;}
            if(mid == len-1) {right = mid-1; continue;}
            if(val > mountainArr.get(mid-1) && val > mountainArr.get(mid+1)){
                high = mid;break;
            }
            
            if(val < mountainArr.get(mid+1)){
                left = mid+1;
            }
            else if(val < mountainArr.get(mid-1)){
                right = mid-1;
            }
        }
        
        left = 0, right = high;
        bool found = false;
        while(left<=right){
            int mid =left+(right-left)/2;
            int v = mountainArr.get(mid);
            if(v == target){
                found = true;
                return mid;
            } 
            else if(v <target) left= mid+1;
            else right = mid-1;
        }
        if(found == false){
            
            int l = high, r = len-1;
            
            while(l<=r){
                int mid = l+(r-l)/2;
                int v = mountainArr.get(mid);
                if(v == target) return mid;
                else if(v>target) l = mid+1;
                else r = mid-1;
            }
        }
        return -1;
    }
};