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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46.9K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 46886, \"totalSubmissionRaw\": 80847, \"acRate\": \"58.0%\"}",
"stats": "{\"totalAccepted\": \"46.9K\", \"totalSubmission\": \"80.9K\", \"totalAcceptedRaw\": 46890, \"totalSubmissionRaw\": 80854, \"acRate\": \"58.0%\"}",
"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.",