mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-09 17:31:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>在一个二维的花园中,有一些用 (x, y) 坐标表示的树。由于安装费用十分昂贵,你的任务是先用<strong>最短</strong>的绳子围起所有的树。只有当所有的树都被绳子包围时,花园才能围好栅栏。你需要找到正好位于栅栏边界上的树的坐标。</p>\r\n\r\n<p> </p>\r\n\r\n<p><strong>示例 1:</strong></p>\r\n\r\n<pre><strong>输入:</strong> [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]\r\n<strong>输出:</strong> [[1,1],[2,0],[4,2],[3,3],[2,4]]\r\n<strong>解释:</strong>\r\n<img src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/erect_the_fence_1.png\" style=\"width: 100%; max-width: 320px\">\r\n</pre>\r\n\r\n<p><strong>示例 2:</strong></p>\r\n\r\n<pre><strong>输入:</strong> [[1,2],[2,2],[4,2]]\r\n<strong>输出:</strong> [[1,2],[2,2],[4,2]]\r\n<strong>解释:</strong>\r\n<img src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/erect_the_fence_2.png\" style=\"width: 100%; max-width: 320px\">\r\n即使树都在一条直线上,你也需要先用绳子包围它们。\r\n</pre>\r\n\r\n<p> </p>\r\n\r\n<p><strong>注意:</strong></p>\r\n\r\n<ol>\r\n\t<li>所有的树应当被围在一起。你不能剪断绳子来包围树或者把树分成一组以上。</li>\r\n\t<li>输入的整数在 0 到 100 之间。</li>\r\n\t<li>花园至少有一棵树。</li>\r\n\t<li>所有树的坐标都是不同的。</li>\r\n\t<li>输入的点<strong>没有</strong>顺序。输出顺序也没有要求。</li>\r\n</ol>",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 90,
|
||||
"likes": 189,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"6.6K\", \"totalAcceptedRaw\": 2607, \"totalSubmissionRaw\": 6567, \"acRate\": \"39.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"23.8K\", \"totalAcceptedRaw\": 14813, \"totalSubmissionRaw\": 23762, \"acRate\": \"62.3%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user