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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"369K\", \"totalSubmission\": \"564.4K\", \"totalAcceptedRaw\": 368993, \"totalSubmissionRaw\": 564402, \"acRate\": \"65.4%\"}",
"stats": "{\"totalAccepted\": \"369.1K\", \"totalSubmission\": \"564.5K\", \"totalAcceptedRaw\": 369068, \"totalSubmissionRaw\": 564517, \"acRate\": \"65.4%\"}",
"hints": [
"Build an array dp where dp[i] is the minimum cost to climb to the top starting from the ith staircase.",
"Assuming we have n staircase labeled from 0 to n - 1 and assuming the top is n, then dp[n] = 0, marking that if you are at the top, the cost is 0.",