update

leetcode-cn/originData/qing-wa-tiao-tai-jie-wen-ti-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>一只青蛙一次可以跳上1级台阶，也可以跳上2级台阶。求该青蛙跳上一个 <code>n</code>&nbsp;级的台阶总共有多少种跳法。</p>\n\n<p>答案需要取模 1e9+7（1000000007），如计算初始结果为：1000000008，请返回 1。</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>n = 2\n<strong>输出：</strong>2\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>n = 7\n<strong>输出：</strong>21\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre><strong>输入：</strong>n = 0\n<strong>输出：</strong>1</pre>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>0 &lt;= n &lt;= 100</code></li>\n</ul>\n\n<p>注意：本题与主站 70 题相同：<a href=\"https://leetcode-cn.com/problems/climbing-stairs/\">https://leetcode-cn.com/problems/climbing-stairs/</a></p>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 264,
+            "likes": 275,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"260.3K\", \"totalSubmission\": \"574.7K\", \"totalAcceptedRaw\": 260335, \"totalSubmissionRaw\": 574739, \"acRate\": \"45.3%\"}",
+            "stats": "{\"totalAccepted\": \"272.2K\", \"totalSubmission\": \"599.4K\", \"totalAcceptedRaw\": 272228, \"totalSubmissionRaw\": 599373, \"acRate\": \"45.4%\"}",
             "hints": [],
             "solution": null,
             "status": null,