coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/cherry-pickup-ii.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1876,
"likes": 1879,
"dislikes": 18,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"56.8K\", \"totalSubmission\": \"80.2K\", \"totalAcceptedRaw\": 56786, \"totalSubmissionRaw\": 80214, \"acRate\": \"70.8%\"}",
"stats": "{\"totalAccepted\": \"56.9K\", \"totalSubmission\": \"80.3K\", \"totalAcceptedRaw\": 56876, \"totalSubmissionRaw\": 80341, \"acRate\": \"70.8%\"}",
"hints": [
"Use dynammic programming, define DP[i][j][k]: The maximum cherries that both robots can take starting on the ith row, and column j and k of Robot 1 and 2 respectively."
],