목록1584. Min Cost to Connect All Points (1)

Scribbling

LeetCode: 1584. Min Cost to Connect All Points

class Solution: def minCostConnectPoints(self, points: List[List[int]]) -> int: def calc_Dist(p1, p2): d1 = abs(p1[0] - p2[0]) d2 = abs(p1[1] - p2[1]) return d1 + d2 def find_parent(parent, a): if parent[a] == a: return a parent[a] = find_parent(parent, parent[a]) return parent[a] def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: ..
Computer Science/Coding Test 2021. 8. 13. 22:56
이전 Prev 1 Next 다음