coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 06:48:57 +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/[no content]erect-the-fence-ii.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"100\", \"totalSubmission\": \"272\", \"totalAcceptedRaw\": 100, \"totalSubmissionRaw\": 272, \"acRate\": \"36.8%\"}",
"stats": "{\"totalAccepted\": \"106\", \"totalSubmission\": \"283\", \"totalAcceptedRaw\": 106, \"totalSubmissionRaw\": 283, \"acRate\": \"37.5%\"}",
"hints": [
"First, we need to note that this is a classic problem given n points you need to find the minimum enclosing circle to bind them",
"Second, we need to apply a well known algorithm called welzls algorithm to help us find the minimum enclosing circle"