coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"36.7K\", \"totalAcceptedRaw\": 13263, \"totalSubmissionRaw\": 36662, \"acRate\": \"36.2%\"}",
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"36.7K\", \"totalAcceptedRaw\": 13263, \"totalSubmissionRaw\": 36663, \"acRate\": \"36.2%\"}",
"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."