mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-24 22:38:57 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"11.5K\", \"totalAcceptedRaw\": 4460, \"totalSubmissionRaw\": 11483, \"acRate\": \"38.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"11.5K\", \"totalAcceptedRaw\": 4467, \"totalSubmissionRaw\": 11498, \"acRate\": \"38.9%\"}",
|
||||
"hints": [
|
||||
"We need to try all possible divisions for the current row to get the max score.",
|
||||
"As calculating all possible divisions will lead us to calculate some sub-problems more than once, we need to think of dynamic programming."
|
||||
|
||||
Reference in New Issue
Block a user