coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-14 03:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
算法题（国内版）/problem (Chinese)/青蛙跳台阶问题 [qing-wa-tiao-tai-jie-wen-ti-lcof].html Normal file
View File

@@ -0,0 +1,30 @@
<p>一只青蛙一次可以跳上1级台阶，也可以跳上2级台阶。求该青蛙跳上一个 <code>n</code>&nbsp;级的台阶总共有多少种跳法。</p>
<p>答案需要取模 1e9+7（1000000007），如计算初始结果为：1000000008，请返回 1。</p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>n = 2
<strong>输出：</strong>2
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>n = 7
<strong>输出：</strong>21
</pre>
<p><strong>示例 3：</strong></p>
<pre><strong>输入：</strong>n = 0
<strong>输出：</strong>1</pre>
<p><strong>提示：</strong></p>
<ul>
<li><code>0 &lt;= n &lt;= 100</code></li>
</ul>
<p>注意：本题与主站 70 题相同：<a href="https://leetcode-cn.com/problems/climbing-stairs/">https://leetcode-cn.com/problems/climbing-stairs/</a></p>
<p>&nbsp;</p>