coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 19:46:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
leetcode-cn/problem (English)/搜索旋转数组(English) [search-rotate-array-lcci].html Normal file
View File

@@ -0,0 +1,21 @@
<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 &lt;= arr.length &lt;= 1000000</code></li>
</ol>