coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +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

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

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 49,
"likes": 51,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Koko Eating Bananas\", \"titleSlug\": \"koko-eating-bananas\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u7231\\u5403\\u9999\\u8549\\u7684\\u73c2\\u73c2\"}]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1397, \"totalSubmissionRaw\": 2321, \"acRate\": \"60.2%\"}",
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1522, \"totalSubmissionRaw\": 2479, \"acRate\": \"61.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?\""
],