mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 16:01:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<p>Return <i>the number of hills and valleys in </i><code>nums</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [2,4,1,1,6,5]
|
||||
@@ -20,7 +20,7 @@ At index 5: There is no non-equal neighbor of 5 on the right, so index 5 is neit
|
||||
There are 3 hills and valleys so we return 3.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> nums = [6,6,5,5,4,1]
|
||||
|
Reference in New Issue
Block a user