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-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

2
leetcode-cn/originData/[no content]minimum-number-of-lines-to-cover-points.json
View File

@@ -70,7 +70,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"123\", \"totalSubmission\": \"247\", \"totalAcceptedRaw\": 123, \"totalSubmissionRaw\": 247, \"acRate\": \"49.8%\"}",
"stats": "{\"totalAccepted\": \"137\", \"totalSubmission\": \"279\", \"totalAcceptedRaw\": 137, \"totalSubmissionRaw\": 279, \"acRate\": \"49.1%\"}",
"hints": [
"What is the highest possible answer for a set of n points?",
"The highest possible answer is n / 2 (rounded up). This is because you can cover at least two points with a line, and if n is odd, you need to add one extra line to cover the last point.",