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) [three-steps-problem-lcci].html
View File

@@ -1,21 +1,21 @@
<p>A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs.&nbsp;The result may be large, so return it modulo 1000000007.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: n = 3
<strong> Output</strong>: 4
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: n = 5
<strong> Output</strong>: 13
</pre>
<p><strong>Note:</strong></p>
<ol>
<li><code>1 &lt;= n &lt;= 1000000</code></li>
</ol>
<p>A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs.&nbsp;The result may be large, so return it modulo 1000000007.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: n = 3
<strong> Output</strong>: 4
</pre>
<p><strong>Example2:</strong></p>