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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 9145, \"totalSubmissionRaw\": 23550, \"acRate\": \"38.8%\"}",
"stats": "{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 9149, \"totalSubmissionRaw\": 23555, \"acRate\": \"38.8%\"}",
"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."