Leetcode Problem 587. Erect the Fence
Leetcode Solutions
Approach: Jarvis Algorithm
- Find the leftmost point in the set of points.
- Initialize the current point as the leftmost point found.
- Loop until the hull is formed: a. Select the next point by finding the most counterclockwise point relative to the current point. b. Check for collinear points and include the farthest one. c. Update the current point to the next point.
- Repeat the process until the starting point is reached again.
- Return the points that form the convex hull.
Approach: Graham Scan Algorithm
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...