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/maximum-number-of-darts-inside-of-a-circular-dartboard.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 108,
"dislikes": 239,
"likes": 109,
"dislikes": 241,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[-2,0],[2,0],[0,2],[0,-2]]\n2\n[[-3,0],[3,0],[2,6],[5,4],[0,9],[7,8]]\n5",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 4526, \"totalSubmissionRaw\": 12447, \"acRate\": \"36.4%\"}",
"stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 4555, \"totalSubmissionRaw\": 12509, \"acRate\": \"36.4%\"}",
"hints": [
"If there is an optimal solution, you can always move the circle so that two points lie on the boundary of the circle.",
"When the radius is fixed, you can find either 0 or 1 or 2 circles that pass two given points at the same time.",