Package g0501_0600.s0587_erect_the_fence

Class Solution

java.lang.Object

g0501_0600.s0587_erect_the_fence.Solution

public class Solution
extends Object

587 - Erect the Fence.<p>Hard</p> <p>You are given an array <code>trees</code> where <code>trees[i] = [x_i, y_i]</code> represents the location of a tree in the garden.</p> <p>You are asked to 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>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/24/erect2-plane.jpg" alt="" /></p> <p><strong>Input:</strong> points = [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]</p> <p><strong>Output:</strong> [[1,1],[2,0],[3,3],[2,4],[4,2]]</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/04/24/erect1-plane.jpg" alt="" /></p> <p><strong>Input:</strong> points = [[1,2],[2,2],[4,2]]</p> <p><strong>Output:</strong> [[4,2],[2,2],[1,2]]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= points.length <= 3000</code></li> <li><code>points[i].length == 2</code></li> <li><code>0 <= x_i, y_i <= 100</code></li> <li>All the given points are <strong>unique</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[][]	outerTrees(int[][] trees)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

outerTrees

public int[][] outerTrees(int[][] trees)