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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/min-cost-climbing-stairs.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 5607,
"dislikes": 978,
"likes": 5759,
"dislikes": 997,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Climbing Stairs\", \"titleSlug\": \"climbing-stairs\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[10,15,20]\n[1,100,1,1,1,100,1,1,100,1]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"439.2K\", \"totalSubmission\": \"752.4K\", \"totalAcceptedRaw\": 439192, \"totalSubmissionRaw\": 752361, \"acRate\": \"58.4%\"}",
"stats": "{\"totalAccepted\": \"455.5K\", \"totalSubmission\": \"776.4K\", \"totalAcceptedRaw\": 455512, \"totalSubmissionRaw\": 776382, \"acRate\": \"58.7%\"}",
"hints": [
"Say f[i] is the final cost to climb to the top from step i. Then f[i] = cost[i] + min(f[i+1], f[i+2])."
],