DevYoon

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ๋„คํŠธ์›Œํฌ (Python) ๋ณธ๋ฌธ

PS/Programmers

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ๋„คํŠธ์›Œํฌ (Python)

gimewn 2022. 4. 19. 16:33

link ๐Ÿ”— https://programmers.co.kr/learn/courses/30/lessons/43162

 

์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ๋„คํŠธ์›Œํฌ

๋„คํŠธ์›Œํฌ๋ž€ ์ปดํ“จํ„ฐ ์ƒํ˜ธ ๊ฐ„์— ์ •๋ณด๋ฅผ ๊ตํ™˜ํ•  ์ˆ˜ ์žˆ๋„๋ก ์—ฐ๊ฒฐ๋œ ํ˜•ํƒœ๋ฅผ ์˜๋ฏธํ•ฉ๋‹ˆ๋‹ค. ์˜ˆ๋ฅผ ๋“ค์–ด, ์ปดํ“จํ„ฐ A์™€ ์ปดํ“จํ„ฐ B๊ฐ€ ์ง์ ‘์ ์œผ๋กœ ์—ฐ๊ฒฐ๋˜์–ด์žˆ๊ณ , ์ปดํ“จํ„ฐ B์™€ ์ปดํ“จํ„ฐ C๊ฐ€ ์ง์ ‘์ ์œผ๋กœ ์—ฐ๊ฒฐ๋˜์–ด ์žˆ

programmers.co.kr

1๏ธโƒฃ check ๋ฐฐ์—ด์„ ํ™œ์šฉํ•˜์—ฌ ๊ฐ’ ๊ตฌํ•˜๊ธฐ

def solution(n, computers):
    cnt = 1
    check = [0]*n
    def dfs(now):
        nonlocal cnt
        for j in range(n):
            if computers[now][j] == 1 and check[j] == 0:
                check[j] = cnt
                dfs(j)
    
    for idx in range(n):
        if check[idx] == 0:
            check[idx] = cnt
            dfs(idx)
            cnt += 1
    
    answer = max(check)
    
    return answer