mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"21K\", \"totalSubmission\": \"46.7K\", \"totalAcceptedRaw\": 21032, \"totalSubmissionRaw\": 46697, \"acRate\": \"45.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"21K\", \"totalSubmission\": \"46.7K\", \"totalAcceptedRaw\": 21035, \"totalSubmissionRaw\": 46701, \"acRate\": \"45.0%\"}",
|
||||
"hints": [
|
||||
"Consider using dynamic programming to find the maximum number of moves that can be made from each cell.",
|
||||
"The final answer will be the maximum value in cells of the first column."
|
||||
|
Reference in New Issue
Block a user