문제
You are given an array
points
representing integer coordinates of some points on a 2D-plane, where points[i] = [x
i
, y
i
]
.The cost of connecting two points
[x
i
, y
i
]
and [x
j
, y
j
]
is the manhattan distance between them: |x
i
- x
j
| + |y
i
- y
j
|
, where |val|
denotes the absolute value of val
.Return the minimum cost to make all points connected. All points are connected if there is exactly one simple path between any two points.

Example 2:
Constraints:
1 <= points.length <= 1000
10
6
<= x
i
, y
i
<= 10
6
- All pairs
(x
i
, y
i
)
are distinct.