[PS] programmers 43165 타겟 넘버

문제 링크
참고한 블로그

BFS를 이용한 풀이

def solution(numbers, target):
    answer = 0
    leaves = [0]
    
    for x in numbers:
        temp = []
        for parent in leaves:
            temp.append(parent + x)
            temp.append(parent - x)
        leaves = temp
    
    for leaf in leaves:
        if leaf == target:
            answer += 1
            
    return answer