1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 3958,
"likes": 3974,
"dislikes": 93,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Split Array Largest Sum\", \"titleSlug\": \"split-array-largest-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Divide Chocolate\", \"titleSlug\": \"divide-chocolate\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Cutting Ribbons\", \"titleSlug\": \"cutting-ribbons\", \"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}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"137.7K\", \"totalSubmission\": \"217.5K\", \"totalAcceptedRaw\": 137704, \"totalSubmissionRaw\": 217454, \"acRate\": \"63.3%\"}",
"stats": "{\"totalAccepted\": \"138.2K\", \"totalSubmission\": \"218.1K\", \"totalAcceptedRaw\": 138164, \"totalSubmissionRaw\": 218138, \"acRate\": \"63.3%\"}",
"hints": [
"Binary search on the answer. We need a function possible(capacity) which returns true if and only if we can do the task in D days."
],