coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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/minimum-falling-path-sum-ii.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36K\", \"totalSubmission\": \"58.6K\", \"totalAcceptedRaw\": 36014, \"totalSubmissionRaw\": 58568, \"acRate\": \"61.5%\"}",
"stats": "{\"totalAccepted\": \"36K\", \"totalSubmission\": \"58.6K\", \"totalAcceptedRaw\": 36016, \"totalSubmissionRaw\": 58570, \"acRate\": \"61.5%\"}",
"hints": [
"Use dynamic programming.",
"Let dp[i][j] be the answer for the first i rows such that column j is chosen from row i.",