LeetCode [1095] Find in Mountain Array

 1095. Find in Mountain Array

Hard

(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:

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63

/** * // This is MountainArray's API interface. * // You should not implement it, or speculate about its implementation * interface MountainArray { * public int get(int index) {} * public int length() {} * } */ class Solution { int[] arr; MountainArray mountainArr; int get(int index){ if(arr[index]>=0) return arr[index]; int v = mountainArr.get(index); arr[index] = v; return v; } public int findInMountainArray(int target, MountainArray mountainArr) { this.mountainArr = mountainArr; int n = mountainArr.length(); arr = new int[n]; Arrays.fill(arr, -1); //find topIndex int l = 0, r = n-1; int topIndex = -1; while(l<=r){ int m = (l+r)/2; if(m-1>=0 && get(m-1)<get(m) && m+1<n && get(m+1)<get(m)){ topIndex = m; break; }else if(m+1<n && get(m+1)>get(m)){ l = m+1; }else{ r = m-1; } } //left l = 0; r = topIndex; while(l<=r){ int m = (l+r)/2; if(get(m)==target) return m; else if(get(m)<target) l = m+1; else r = m-1; } //right l = topIndex+1; r = n-1; while(l<=r){ int m = (l+r)/2; if(get(m)==target) return m; else if(get(m)<target) r = m-1; else l = m+1; } return -1; } }