mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<p>Return <em>the number of <strong>smooth descent periods</strong></em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> prices = [3,2,1,4]
|
||||
@@ -15,7 +15,7 @@
|
||||
Note that a period with one day is a smooth descent period by the definition.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> prices = [8,6,7,7]
|
||||
@@ -24,7 +24,7 @@ Note that a period with one day is a smooth descent period by the definition.
|
||||
Note that [8,6] is not a smooth descent period as 8 - 6 ≠ 1.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> prices = [1]
|
||||
|
Reference in New Issue
Block a user