这是一个交互式问题，涉及在未知大小的有序数组中使用二分查找找到特定元素的索引。通过提供的API接口获取数组中指定索引的值或确认索引是否超出范围。由于数组严格递增，可以应用二分查找策略。题目限制了数组长度在1到10000之间，数值范围在-10000到10000，这些条件简化了问题，使得即使API返回大数也能有效进行二分查找。
This is an interactive problem.
You have a sorted array of unique elements and an unknown size. You do not have an access to the array but you can use the ArrayReader interface to access it. You can call ArrayReader.get(i) that:
- returns the value at the
ithindex (0-indexed) of the secret array (i.e.,secret[i]), or - returns
2^31 - 1if theiis out of the boundary of the array.
You are also given an integer target.
Return the index k of the hidden array where secret[k] == target or return -1 otherwise.
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: secret = [-1,0,3,5,9,12], target = 9 Output:
最低0.47元/天 解锁文章
3589
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
