LeetCode 솔루션					분류
				
						[11/19] 587. Erect the Fence
본문
Hard
1187599Add to ListShareYou are given an array trees where trees[i] = [xi, yi] represents the location of a tree in the garden.
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 all the trees are enclosed.
Return the coordinates of trees that are exactly located on the fence perimeter.
Example 1:

Input: points = [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]] Output: [[1,1],[2,0],[3,3],[2,4],[4,2]]
Example 2:

Input: points = [[1,2],[2,2],[4,2]] Output: [[4,2],[2,2],[1,2]]
Constraints:
- 1 <= points.length <= 3000
- points[i].length == 2
- 0 <= xi, yi <= 100
- All the given points are unique.
Accepted
47,144
Submissions
90,852
				태그
				#Google			
			관련자료
- 
			링크
			댓글 0
					
			
				등록된 댓글이 없습니다.
			
					 
								 
							








