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

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,21 +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>
<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>