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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/capacity-to-ship-packages-within-d-days.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 8924,
"likes": 8926,
"dislikes": 192,
"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}, {\"title\": \"Maximum Bags With Full Capacity of Rocks\", \"titleSlug\": \"maximum-bags-with-full-capacity-of-rocks\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Total Distance Traveled\", \"titleSlug\": \"minimum-total-distance-traveled\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"323.9K\", \"totalSubmission\": \"471.6K\", \"totalAcceptedRaw\": 323920, \"totalSubmissionRaw\": 471616, \"acRate\": \"68.7%\"}",
"stats": "{\"totalAccepted\": \"324K\", \"totalSubmission\": \"471.7K\", \"totalAcceptedRaw\": 323975, \"totalSubmissionRaw\": 471682, \"acRate\": \"68.7%\"}",
"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."
],