coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +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

28
leetcode-cn/problem (English)/峰与谷(English) [peaks-and-valleys-lcci].html
View File

@@ -1,14 +1,14 @@
<p>In an array of integers, a &quot;peak&quot; is an element which is greater than or equal to the adjacent integers and a &quot;valley&quot; is an element which is less than or equal to the adjacent inte&shy;gers. For example, in the array {5, 8, 4, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given an array of integers, sort the array into an alternating sequence of peaks and valleys.</p>
<p><strong>Example:</strong></p>
<pre>
<strong>Input: </strong>[5, 3, 1, 2, 3]
<strong>Output:</strong>&nbsp;[5, 1, 3, 2, 3]
</pre>
<p><strong>Note: </strong></p>
<ul>
<li><code>nums.length &lt;= 10000</code></li>
</ul>
<p>In an array of integers, a &quot;peak&quot; is an element which is greater than or equal to the adjacent integers and a &quot;valley&quot; is an element which is less than or equal to the adjacent inte&shy;gers. For example, in the array {5, 8, 4, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given an array of integers, sort the array into an alternating sequence of peaks and valleys.</p>
<p><strong>Example:</strong></p>
<pre>
<strong>Input: </strong>[5, 3, 1, 2, 3]
<strong>Output:</strong>&nbsp;[5, 1, 3, 2, 3]