mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 6073, \"totalSubmissionRaw\": 9662, \"acRate\": \"62.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 6074, \"totalSubmissionRaw\": 9663, \"acRate\": \"62.9%\"}",
|
||||
"hints": [
|
||||
"If k =1, the minimum distance is obtained allocating the mailbox in the median of the array houses.",
|
||||
"Generalize this idea, using dynamic programming allocating k mailboxes."
|
||||
|
Reference in New Issue
Block a user