coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/[no content]erect-the-fence-ii.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"418\", \"totalSubmission\": \"718\", \"totalAcceptedRaw\": 418, \"totalSubmissionRaw\": 718, \"acRate\": \"58.2%\"}",
"stats": "{\"totalAccepted\": \"421\", \"totalSubmission\": \"722\", \"totalAcceptedRaw\": 421, \"totalSubmissionRaw\": 722, \"acRate\": \"58.3%\"}",
"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"