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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"93K\", \"totalSubmission\": \"133.8K\", \"totalAcceptedRaw\": 92986, \"totalSubmissionRaw\": 133820, \"acRate\": \"69.5%\"}",
"stats": "{\"totalAccepted\": \"93K\", \"totalSubmission\": \"133.8K\", \"totalAcceptedRaw\": 92995, \"totalSubmissionRaw\": 133830, \"acRate\": \"69.5%\"}",
"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."
],