[LeetCode] Search in a Sorted Array of Unknown Size 在未知大小的有序数组中搜索

Posted Grandyang

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Search in a Sorted Array of Unknown Size 在未知大小的有序数组中搜索相关的知识,希望对你有一定的参考价值。

 

Given an integer array sorted in ascending order, write a function to search target in nums.  If target exists, then return its index, otherwise return -1. However, the array size is unknown to you. You may only access the array using an ArrayReader interface, where ArrayReader.get(k) returns the element of the array at index k (0-indexed).

You may assume all integers in the array are less than 10000, and if you access the array out of bounds, ArrayReader.get will return 2147483647.

 

Example 1:

Input: array = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4

Example 2:

Input: array = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1

 

Note:

  1. You may assume that all elements in the array are unique.
  2. The value of each element in the array will be in the range [-9999, 9999].

 

s

 

以上是关于[LeetCode] Search in a Sorted Array of Unknown Size 在未知大小的有序数组中搜索的主要内容,如果未能解决你的问题,请参考以下文章

[Leetcode]700. Search in a Binary Search Tree

LeetCode | 0700. Search in a Binary Search Tree二叉搜索树中的搜索Python

LeetCode Verify Preorder Sequence in Binary Search Tree

LeetCode 700 Search in a Binary Search Tree 解题报告

一天一道LeetCode#33. Search in Rotated Sorted Array

[LeetCode in Python] 79 (M) word search 单词搜索