프로그래머스. 단어변환

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

프로그래머스

 

전체 코드

한승협님 코드

def diff(a,b):
    return sum([0 if a[i]==b[i] else 1 for i in range(len(a))])

def dfs(begin, target, words):
    li = []
    if begin == target:
        return [len(words)]
    if target not in words:
        return [len(words)]
    for i in range(len(words)):
        if diff(begin, words[i]) == 1:
            val = dfs(words[i], target, words[:i] + words[i+1:]) 
            if val:
                li += val
    return li

def solution(begin, target, words):
    return len(words) - max(dfs(begin, target, words))