(这是一个 交互式问题 )
给你一个 山脉数组 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。
提示:
3 <= mountain_arr.length() <= 10000
0 <= target <= 10^9
0 <= mountain_arr.get(index) <= 10^9
package com.atta.boss.webapp; import java.util.ArrayList; import java.util.List; /** * sujiale */ class Solution { public static void main(String[] args) { int inMountainArray = new Solution().findInMountainArray(3, new MountainArray()); System.out.println(inMountainArray); } public int findInMountainArray(int target, MountainArray mountainArr) { List<Integer> list = new ArrayList<>(); findValue(target, mountainArr, 0, mountainArr.length() - 1, list); if (list.isEmpty()) { return -1; } else if (list.size() == 1) { return list.get(0); } else { return list.get(0) > list.get(1) ? list.get(1) : list.get(0); } } private boolean leftDone = false; private boolean rightDone = false; public void findValue(int target, MountainArray mountainArr, int start, int end, List<Integer> list) { if (list.size() == 2) { return; } if (end - start <= 1) { if (start <= end) { if (mountainArr.get(start) == target) { list.add(start); } if (end - start == 1 && (mountainArr.get(start + 1) == target)) { list.add(end); } } return; } int middle = (start + end) / 2; int middleValue = mountainArr.get(middle); if (middleValue == target) { list.add(middle); } int next = mountainArr.get(middle + 1); if (next == target) { list.add(middle + 1); } if (middleValue < next) { //递增序列,后续可能有递减 if (!leftDone && middleValue > target) { //当前数据大于target,查询前面数据 leftDone = true; findIncreaseList(target, mountainArr, start, middle - 1, list, true); } //查询后面数据 findValue(target, mountainArr, middle + 1, end, list); } else { //递减序列,前面可能有递增 if (!rightDone && middleValue > target) { rightDone = true; //当前数据大于target,查询后面数据 findIncreaseList(target, mountainArr, middle + 1, end, list, false); } //查询前面数据 findValue(target, mountainArr, start, middle - 1, list); } } /** * 递增/递减队列 */ void findIncreaseList(int target, MountainArray mountainArr, int start, int end, List<Integer> list, boolean isIncreaseList) { if (end - start <= 1) { if (start <= end) { if (mountainArr.get(start) == target) { list.add(start); } if (end - start == 1 && mountainArr.get(end) == target) { list.add(end); } } return; } int middle = (start + end) / 2; int middleVale = mountainArr.get(middle); if (middleVale == target) { list.add(middle); return; } if (isIncreaseList) { if (middleVale > target) { findIncreaseList(target, mountainArr, start, middle - 1, list, true); } else { findIncreaseList(target, mountainArr, middle + 1, end, list, true); } } else { if (middleVale > target) { findIncreaseList(target, mountainArr, middle + 1, end, list, false); } else { findIncreaseList(target, mountainArr, start, middle - 1, list, false); } } } static class MountainArray { int x = 0; private int[] values = new int[]{1, 2, 3, 4, 5, 3, 1}; public int get(int index) { System.out.println(++x); return values[index]; } public int length() { return values.length; } } }