coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/allocate-mailboxes.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 683,
"likes": 686,
"dislikes": 12,
"isLiked": null,
"similarQuestions": "[]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15K\", \"totalSubmission\": \"27K\", \"totalAcceptedRaw\": 14976, \"totalSubmissionRaw\": 27044, \"acRate\": \"55.4%\"}",
"stats": "{\"totalAccepted\": \"15K\", \"totalSubmission\": \"27.1K\", \"totalAcceptedRaw\": 15000, \"totalSubmissionRaw\": 27081, \"acRate\": \"55.4%\"}",
"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."