coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/[no content]minimize-max-distance-to-gas-station.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 574,
"likes": 575,
"dislikes": 82,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Koko Eating Bananas\", \"titleSlug\": \"koko-eating-bananas\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 25176, \"totalSubmissionRaw\": 50102, \"acRate\": \"50.2%\"}",
"stats": "{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 25208, \"totalSubmissionRaw\": 50148, \"acRate\": \"50.3%\"}",
"hints": [
"Use a binary search. We'll binary search the monotone function \"possible(D) = can we use K or less gas stations to ensure each adjacent distance between gas stations is at most D?\""
],