mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,10 +11,10 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 888,
|
||||
"dislikes": 31,
|
||||
"likes": 983,
|
||||
"dislikes": 32,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Minimized Maximum of Products Distributed to Any Store\", \"titleSlug\": \"minimized-maximum-of-products-distributed-to-any-store\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"similarQuestions": "[{\"title\": \"Maximum Candies Allocated to K Children\", \"titleSlug\": \"maximum-candies-allocated-to-k-children\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimized Maximum of Products Distributed to Any Store\", \"titleSlug\": \"minimized-maximum-of-products-distributed-to-any-store\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[9]\n2\n[2,4,8,2]\n4\n[7,17]\n2",
|
||||
"categoryTitle": "Algorithms",
|
||||
"contributors": [],
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"27.1K\", \"totalAcceptedRaw\": 15335, \"totalSubmissionRaw\": 27073, \"acRate\": \"56.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 16943, \"totalSubmissionRaw\": 29460, \"acRate\": \"57.5%\"}",
|
||||
"hints": [
|
||||
"Let's change the question if we know the maximum size of a bag what is the minimum number of bags you can make",
|
||||
"note that as the maximum size increases the minimum number of bags decreases so we can binary search the maximum size"
|
||||
|
Reference in New Issue
Block a user