coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +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

2
leetcode-cn/originData/minimum-falling-path-sum-ii.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 8972, \"totalSubmissionRaw\": 14679, \"acRate\": \"61.1%\"}",
"stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 9532, \"totalSubmissionRaw\": 15717, \"acRate\": \"60.6%\"}",
"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.",