魔术索引
题目链接:https://leetcode-cn.com/problems/magic-index-lcci/
间接跳跃查找(leetcode给的测试好像都是递增的)
class Solution {
public int findMagicIndex(int[] nums) {
for(int i=0;i<nums.length;){
if(i == nums[i]) return i;
i = Math.max(i+1,nums[i]);
}
return -1;
}
}
不一样的烟火