1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>假设你正在爬楼梯。需要 <code>n</code>&nbsp;阶你才能到达楼顶。</p>\n\n<p>每次你可以爬 <code>1</code> 或 <code>2</code> 个台阶。你有多少种不同的方法可以爬到楼顶呢?</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 2\n<strong>输出:</strong>2\n<strong>解释:</strong>有两种方法可以爬到楼顶。\n1. 1 阶 + 1 阶\n2. 2 阶</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 3\n<strong>输出:</strong>3\n<strong>解释:</strong>有三种方法可以爬到楼顶。\n1. 1 阶 + 1 阶 + 1 阶\n2. 1 阶 + 2 阶\n3. 2 阶 + 1 阶\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 45</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 2308,
"likes": 2385,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Min Cost Climbing Stairs\", \"titleSlug\": \"min-cost-climbing-stairs\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4f7f\\u7528\\u6700\\u5c0f\\u82b1\\u8d39\\u722c\\u697c\\u68af\"}, {\"title\": \"Fibonacci Number\", \"titleSlug\": \"fibonacci-number\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u6590\\u6ce2\\u90a3\\u5951\\u6570\"}, {\"title\": \"N-th Tribonacci Number\", \"titleSlug\": \"n-th-tribonacci-number\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u7b2c N \\u4e2a\\u6cf0\\u6ce2\\u90a3\\u5951\\u6570\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"764.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 764695, \"totalSubmissionRaw\": 1427466, \"acRate\": \"53.6%\"}",
"stats": "{\"totalAccepted\": \"802.6K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 802640, \"totalSubmissionRaw\": 1497209, \"acRate\": \"53.6%\"}",
"hints": [
"To reach nth step, what could have been your previous steps? (Think about the step sizes)"
],