coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51: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

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 734,
"likes": 735,
"dislikes": 62,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Falling Path Sum\", \"titleSlug\": \"minimum-falling-path-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"43.7K\", \"totalAcceptedRaw\": 26850, \"totalSubmissionRaw\": 43701, \"acRate\": \"61.4%\"}",
"stats": "{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"43.8K\", \"totalAcceptedRaw\": 26891, \"totalSubmissionRaw\": 43796, \"acRate\": \"61.4%\"}",
"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.",