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-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

4
leetcode/originData/[no content]erect-the-fence-ii.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 8,
"dislikes": 32,
"dislikes": 33,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Erect the Fence\", \"titleSlug\": \"erect-the-fence\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]\n[[1,2],[2,2],[4,2]]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"421\", \"totalSubmission\": \"722\", \"totalAcceptedRaw\": 421, \"totalSubmissionRaw\": 722, \"acRate\": \"58.3%\"}",
"stats": "{\"totalAccepted\": \"430\", \"totalSubmission\": \"756\", \"totalAcceptedRaw\": 430, \"totalSubmissionRaw\": 756, \"acRate\": \"56.9%\"}",
"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"