Programmers
[python] 섬 연결하기
DylanMsK
2019. 10. 14. 21:56
문제 출처
풀이
def solution(n, costs):
answer = 0
costs.sort(key=lambda x: x[2])
visited = [0] * n
visited[0] = 1
while sum(visited) != n:
for cost in costs:
s, e, c = cost
if visited[s] or visited[e]:
if visited[s] and visited[e]:
continue
else:
visited[s] = 1
visited[e] = 1
answer += c
break
return answer