プログラマ-Lv 3単語変換

1.質問

2.考慮事項

3.解答

4.草コード

from collections import deque


def bfs(begin, target, words):
    size = len(begin)
    queue = deque([(begin, 0)])

    while queue:
        word, step = queue.popleft()

        if word == target:
            return step

        for compare_word, compare_step in words:
            diff = 0

            for i in range(size):
                if diff > 1:
                    break

                if word[i] != compare_word[i]:
                    diff += 1

            if diff == 1:
                queue.append((compare_word, step + 1))

    return 0


def solution(begin, target, words):
    words = list(zip(words, [0] * len(words)))
    return bfs(begin, target, words)

5.学んだこと