mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
33 lines
1.6 KiB
HTML
33 lines
1.6 KiB
HTML
<p>You are given an array <code>trees</code> where <code>trees[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents the location of a tree in the garden.</p>
|
|
|
|
<p>Fence the entire garden using the minimum length of rope, as it is expensive. The garden is well-fenced only if <strong>all the trees are enclosed</strong>.</p>
|
|
|
|
<p>Return <em>the coordinates of trees that are exactly located on the fence perimeter</em>. You may return the answer in <strong>any order</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/24/erect2-plane.jpg" style="width: 400px; height: 393px;" />
|
|
<pre>
|
|
<strong>Input:</strong> trees = [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]
|
|
<strong>Output:</strong> [[1,1],[2,0],[4,2],[3,3],[2,4]]
|
|
<strong>Explanation:</strong> All the trees will be on the perimeter of the fence except the tree at [2, 2], which will be inside the fence.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/24/erect1-plane.jpg" style="width: 400px; height: 393px;" />
|
|
<pre>
|
|
<strong>Input:</strong> trees = [[1,2],[2,2],[4,2]]
|
|
<strong>Output:</strong> [[4,2],[2,2],[1,2]]
|
|
<strong>Explanation:</strong> The fence forms a line that passes through all the trees.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= trees.length <= 3000</code></li>
|
|
<li><code>trees[i].length == 2</code></li>
|
|
<li><code>0 <= x<sub>i</sub>, y<sub>i</sub> <= 100</code></li>
|
|
<li>All the given positions are <strong>unique</strong>.</li>
|
|
</ul>
|