[Java]LeetCode1095. 山脉数组中查找目标值 | Find in Mountain Array

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/11032162.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

(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

---

（这是一个 交互式问题 ）

给你一个 山脉数组 mountainArr，请你返回能够使得 mountainArr.get(index) 等于 target 最小 的下标 index 值。

如果不存在这样的下标 index，就请返回 -1。

所谓山脉数组，即数组 A 假如是一个山脉数组的话，需要满足如下条件：

首先，A.length >= 3

其次，在 0 < i < A.length - 1 条件下，存在 i 使得：

• A[0] < A[1] < ... A[i-1] < A[i]
• A[i] > A[i+1] > ... > A[A.length - 1]

你将 不能直接访问该山脉数组，必须通过 MountainArray 接口来获取数据：

• MountainArray.get(k) - 会返回数组中索引为k 的元素（下标从 0 开始）
• MountainArray.length() - 会返回该数组的长度

注意：

对 MountainArray.get 发起超过 100 次调用的提交将被视为错误答案。此外，任何试图规避判题系统的解决方案都将会导致比赛资格被取消。

为了帮助大家更好地理解交互式问题，我们准备了一个样例 “答案”：https://leetcode-cn.com/playground/RKhe3ave，请注意这 不是一个正确答案。

示例 1：

输入：array = [1,2,3,4,5,3,1], target = 3
输出：2
解释：3 在数组中出现了两次，下标分别为 2 和 5，我们返回最小的下标 2。

示例 2：

输入：array = [0,1,2,4,2,1], target = 3
输出：-1
解释：3 在数组中没有出现，返回 -1。

提示：

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

---

Runtime: 0 ms

C++:

/**
 * // This is the MountainArray's API interface.
 * // You should not implement it, or speculate about its implementation
 * class MountainArray {
 *   public:
 *     int get(int index);
 *     int length();
 * };
 */
class Solution {
public:
    int findInMountainArray(int target, MountainArray &mountainArr) {
        int n = mountainArr.length();
        int low = 1, high = n - 1;
        while (low < high) {
            int mid = (low + high) / 2;

            int a = mountainArr.get(mid - 1), b = mountainArr.get(mid), c = mountainArr.get(mid + 1);

            if (a < b && b > c) {
                low = high = mid;
                break;
            }

            if (a < b && b < c)
                low = mid + 1;
            else if (a > b && b > c)
                high = mid - 1;
            else
                assert(false);
        }

        int mountain = low;

        low = 0;
        high = mountain;

        while (low < high) {
            int mid = (low + high) / 2;

            if (mountainArr.get(mid) >= target)
                high = mid;
            else
                low = mid + 1;
        }

        if (mountainArr.get(low) == target)
            return low;

        low = mountain;
        high = n - 1;

        while (low < high) {
            int mid = (low + high) / 2;

            if (mountainArr.get(mid) <= target)
                high = mid;
            else
                low = mid + 1;
        }

        if (mountainArr.get(low) == target)
            return low;

        return -1;
    }
};

---

0ms

Java:

/**
 * // 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 findInMountainArray(int target, MountainArray A) {
        int n = A.length(), l, r, m, peak = 0;
        // find index of peak
        l  = 0;
        r = n - 1;
        while (l < r) {
            m = (l + r) / 2;
            if (A.get(m) < A.get(m + 1))
                l = peak = m + 1;
            else
                r = m;
        }
        // find target in the left of peak
        l = 0;
        r = peak;
        while (l <= r) {
            m = (l + r) / 2;
            if (A.get(m) < target)
                l = m + 1;
            else if (A.get(m) > target)
                r = m - 1;
            else
                return m;
        }
        // find target in the right of peak
        l = peak;
        r = n - 1;
        while (l <= r) {
            m = (l + r) / 2;
            if (A.get(m) > target)
                l = m + 1;
            else if (A.get(m) < target)
                r = m - 1;
            else
                return m;
        }
        return -1;
    }
}

---

24ms

Python3:

# """
# This is MountainArray's API interface.
# You should not implement it, or speculate about its implementation
# """
#class MountainArray:
#    def get(self, index: int) -> int:
#    def length(self) -> int:

class Solution:
    def findInMountainArray(self, target: int, mo: 'MountainArray') -> int:
        mlen = mo.length()
        left, right, peak = 0, mlen - 1, 0
        while left < right:
            mid = left + (right - left) // 2
            if mo.get(mid + 1) > mo.get(mid):
                peak = mid + 1
                left = mid + 1
            else:
                right = mid - 1
        
        left, right = 0, peak
        while left <= right:
            mid = left + (right - left) // 2
            val = mo.get(mid)
            if val < target:
                left = mid + 1
            elif val == target:
                return mid
            else:
                right = mid - 1

        left, right = peak, mlen - 1
        while left <= right:
            mid = left + (right - left) // 2
            val = mo.get(mid)
            if val < target:
                right = mid - 1
            elif val == target:
                return mid
            else:
                left = mid + 1
                
        return -1