coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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

6
leetcode/originData/best-position-for-a-service-centre.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 161,
"dislikes": 194,
"likes": 162,
"dislikes": 197,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[0,1],[1,0],[1,2],[2,1]]\n[[1,1],[3,3]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 9149, \"totalSubmissionRaw\": 23555, \"acRate\": \"38.8%\"}",
"stats": "{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 9260, \"totalSubmissionRaw\": 23970, \"acRate\": \"38.6%\"}",
"hints": [
"The problem can be reworded as, giving a set of points on a 2d-plane, return the geometric median.",
"Loop over each triplet of points (positions[i], positions[j], positions[k]) where i < j < k, get the centre of the circle which goes throw the 3 points, check if all other points lie in this circle."