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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
leetcode-cn/problem (Chinese)/三步问题 [three-steps-problem-lcci].html Normal file
View File

@@ -0,0 +1,22 @@
<p>三步问题。有个小孩正在上楼梯，楼梯有n阶台阶，小孩一次可以上1阶、2阶或3阶。实现一种方法，计算小孩有多少种上楼梯的方式。结果可能很大，你需要对结果模1000000007。</p>
<p> <strong>示例1:</strong></p>
<pre>
<strong> 输入</strong>：n = 3
<strong> 输出</strong>：4
<strong> 说明</strong>: 有四种走法
</pre>
<p> <strong>示例2:</strong></p>
<pre>
<strong> 输入</strong>：n = 5
<strong> 输出</strong>：13
</pre>
<p> <strong>提示:</strong></p>
<ol>
<li>n范围在[1, 1000000]之间</li>
</ol>