mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 19:31:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
@@ -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>
|
Reference in New Issue
Block a user