coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/minimum-time-to-complete-trips.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 483,
"likes": 485,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Speed to Arrive on Time\", \"titleSlug\": \"minimum-speed-to-arrive-on-time\", \"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 Running Time of N Computers\", \"titleSlug\": \"maximum-running-time-of-n-computers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"61K\", \"totalAcceptedRaw\": 17834, \"totalSubmissionRaw\": 60977, \"acRate\": \"29.2%\"}",
"stats": "{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"61.2K\", \"totalAcceptedRaw\": 17920, \"totalSubmissionRaw\": 61213, \"acRate\": \"29.3%\"}",
"hints": [
"For a given amount of time, how can we count the total number of trips completed by all buses within that time?",
"Consider using binary search."