[BFS&DFS] 프로그래머스_타겟넘버

answer = 0
def dfs(idx, numbers, target, value):
    global answer
    if idx == len(numbers) and target == value:
        answer += 1
        return 
    if idx == len(numbers):
        return 
    
    dfs(idx+1, numbers, target, value+numbers[idx])
    dfs(idx+1, numbers, target, value-numbers[idx])

def solution(numbers, target):
    global answer
    value = 0 
    dfs(0, numbers, target, value)
    
    return answer