coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 06:48:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1392, \"totalSubmissionRaw\": 2312, \"acRate\": \"60.2%\"}",
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1397, \"totalSubmissionRaw\": 2321, \"acRate\": \"60.2%\"}",
"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?\""
],