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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 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": 5594,
"dislikes": 977,
"likes": 5607,
"dislikes": 978,
"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\": \"437.9K\", \"totalSubmission\": \"750.4K\", \"totalAcceptedRaw\": 437941, \"totalSubmissionRaw\": 750368, \"acRate\": \"58.4%\"}",
"stats": "{\"totalAccepted\": \"439.2K\", \"totalSubmission\": \"752.4K\", \"totalAcceptedRaw\": 439192, \"totalSubmissionRaw\": 752361, \"acRate\": \"58.4%\"}",
"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])."
],