【Leetcode】1095. Find in Mountain Array

题目地址：

https://leetcode.com/problems/find-in-mountain-array/description/

给定一个山形数组$A$，其长$n\ge 3$，且$\exists i,0<i<n-1$使得$A[0]<A[1]<...<A[i]>A[i+1]>...>A[n-1]$。给定一个值$t$，问$t$第一次出现的下标。若不存在则返回$-1$。

可以先用二分找到$i$，然后再用二分在两边找$t$。代码如下：

/**
 * // 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 t, MountainArray &A) {
    int n = A.length();
    int l = 0, r = n - 1;
    while (l < r) {
      int mid = l + (r - l >> 1);
      if (A.get(mid) > A.get(mid + 1)) r = mid;
      else l = mid + 1;
    }

    int top = l;
    l = 0, r = top;
    while (l < r) {
      int mid = l + (r - l >> 1);
      if (A.get(mid) >= t) r = mid;
      else l = mid + 1;
    }

    if (A.get(l) == t) return l;
    l = top + 1, r = n - 1;
    while (l < r) {
      int mid = l + (r - l >> 1);
      if (A.get(mid) <= t) r = mid;
      else l = mid + 1;
    }
    if (A.get(l) == t) return l;
    return -1;
  }
};

时间复杂度$O(\log n)$，空间$O(1)$。