mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
22 lines
806 B
HTML
22 lines
806 B
HTML
<p>Given a sorted array of n integers that has been rotated an unknown number of times, write code to find an element in the array. You may assume that the array was originally sorted in increasing order. If there are more than one target elements in the array, return the smallest index.</p>
|
|
|
|
|
|
|
|
<p><strong>Example1:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong> Input</strong>: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 5
|
|
|
|
<strong> Output</strong>: 8 (the index of 5 in the array)
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p><strong>Example2:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong> Input</strong>: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 11
|
|
|
|
<strong> Output</strong>: -1 (not found)
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p><strong>Note:</strong></p>
|
|
|
|
|
|
|
|
<ol>
|
|
|
|
<li><code>1 <= arr.length <= 1000000</code></li>
|
|
|
|
</ol>
|
|
|