타켓 넘버(프로그래머스)

count =0
def dfs(idx,cur_val,numbers,target):
    if idx == len(numbers):
        if(cur_val)== target:
            global count
            count +=1
        return 
    
    dfs(idx+1,cur_val+numbers[idx],numbers, target)
    dfs(idx+1,cur_val-numbers[idx],numbers, target)
    
def solution(numbers, target):
    global count
    dfs(0,0,numbers,target)
    return count