LeetCode 1095 - 山脉数组中查找目标值

题目描述

1095. 山脉数组中查找目标值

解法：二分查找（C++）

这个题其实和之前 LeetCode 33 - 搜索旋转排序数组 原理是一样的，啥都不说就是二分

/**
 * // 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 len = (int)mountainArr.length();
        int maxidx = searchmax(mountainArr, len, 0, len-1);
        int res = searchleft(mountainArr, 0, maxidx, target);
        return res==-1?searchright(mountainArr, maxidx+1, len-1, target):res;
    }

    int searchmax(MountainArray& mountainArr, int len, int lo, int hi){
        if(lo==hi) return lo;
        int mid = (lo+hi)/2;
        if(mid+1<len && mountainArr.get(mid)<mountainArr.get(mid+1))
            return searchmax(mountainArr, len, mid+1, hi);
        else
            return searchmax(mountainArr, len, lo, mid);
    }

    int searchleft(MountainArray& mountainArr, int lo, int hi, int target){
        if(lo<=hi)
        {
            int mid = lo+(hi-lo)/2;
            if(mountainArr.get(mid)==target) 
                return mid;
            else if(target>mountainArr.get(mid))
                return searchleft(mountainArr, mid+1, hi, target);
            else 
                return searchleft(mountainArr, lo, mid-1, target);
        }
        return -1;
    }

        int searchright(MountainArray& mountainArr, int lo, int hi, int target){
        if(lo<=hi)
        {
            int mid = lo+(hi-lo)/2;
            if(mountainArr.get(mid)==target) 
                return mid;
            else if(target>mountainArr.get(mid))
                return searchleft(mountainArr, lo, mid-1, target);
            else 
                return searchleft(mountainArr, mid+1, hi, target);
        }
        return -1;
    }
};