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

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 3537, \"totalSubmissionRaw\": 10230, \"acRate\": \"34.6%\"}",
"stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"10.4K\", \"totalAcceptedRaw\": 3630, \"totalSubmissionRaw\": 10411, \"acRate\": \"34.9%\"}",
"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."