mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 1879,
|
||||
"dislikes": 18,
|
||||
"likes": 1930,
|
||||
"dislikes": 20,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[[3,1,1],[2,5,1],[1,5,5],[2,1,1]]\n[[1,0,0,0,0,0,1],[2,0,0,0,0,3,0],[2,0,9,0,0,0,0],[0,3,0,5,4,0,0],[1,0,2,3,0,0,6]]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"56.9K\", \"totalSubmission\": \"80.3K\", \"totalAcceptedRaw\": 56876, \"totalSubmissionRaw\": 80341, \"acRate\": \"70.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"58.1K\", \"totalSubmission\": \"82.1K\", \"totalAcceptedRaw\": 58077, \"totalSubmissionRaw\": 82104, \"acRate\": \"70.7%\"}",
|
||||
"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."
|
||||
],
|
||||
|
Reference in New Issue
Block a user