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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/[no content]minimize-max-distance-to-gas-station.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 575,
"dislikes": 82,
"likes": 579,
"dislikes": 83,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Koko Eating Bananas\", \"titleSlug\": \"koko-eating-bananas\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5,6,7,8,9,10]\n9\n[23,24,36,39,46,56,57,65,84,98]\n1",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 25208, \"totalSubmissionRaw\": 50148, \"acRate\": \"50.3%\"}",
"stats": "{\"totalAccepted\": \"25.5K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 25453, \"totalSubmissionRaw\": 50485, \"acRate\": \"50.4%\"}",
"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?\""
],