Lv.3_단어 변환

https://school.programmers.co.kr/learn/courses/30/lessons/43163

프로그래머스

from collections import deque

def solution(begin, target, words):
    
    if target not in words:
        return 0
    
    return dfs(begin, target, words)

def dfs(begin, target, words):
    
    queue = deque()
    queue.append([begin, 0])
    
    while queue:
        now, cnt = queue.popleft()
        
        if now == target:
            return cnt
        
        for word in words:
            different = 0
            
            for i in range(len(now)):
                if now[i] != word[i]:
                    different += 1
                    
            if different == 1:
                queue.append([word, cnt+1])

 

'타고 내려간다' == DFS / BFS

 

기억해두자!!