mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"45.1K\", \"totalAcceptedRaw\": 18331, \"totalSubmissionRaw\": 45100, \"acRate\": \"40.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"45.1K\", \"totalAcceptedRaw\": 18333, \"totalSubmissionRaw\": 45107, \"acRate\": \"40.6%\"}",
|
||||
"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