coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 03:11:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode-cn/problem (English)/山脉数组中查找目标值(English) [find-in-mountain-array].html
View File

@@ -27,14 +27,14 @@
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> array = [1,2,3,4,5,3,1], target = 3
<strong>Input:</strong> mountainArr = [1,2,3,4,5,3,1], target = 3
<strong>Output:</strong> 2
<strong>Explanation:</strong> 3 exists in the array, at index=2 and index=5. Return the minimum index, which is 2.</pre>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> array = [0,1,2,4,2,1], target = 3
<strong>Input:</strong> mountainArr = [0,1,2,4,2,1], target = 3
<strong>Output:</strong> -1
<strong>Explanation:</strong> 3 does not exist in <code>the array,</code> so we return -1.
</pre>
@@ -43,7 +43,7 @@
<p><strong>Constraints:</strong></p>
<ul>
<li><code>3 &lt;= mountain_arr.length() &lt;= 10<sup>4</sup></code></li>
<li><code>3 &lt;= mountainArr.length() &lt;= 10<sup>4</sup></code></li>
<li><code>0 &lt;= target &lt;= 10<sup>9</sup></code></li>
<li><code>0 &lt;= mountain_arr.get(index) &lt;= 10<sup>9</sup></code></li>
<li><code>0 &lt;= mountainArr.get(index) &lt;= 10<sup>9</sup></code></li>
</ul>