[파이썬][프로그래머스] 깊이/너비 우선 탐색(DFS/BFS) 타겟 넘버

def solution(numbers, target):
    temp = []
    tempList = []
    for n in numbers:
        if len(temp) == 0:
            temp.append(+n)
            temp.append(-n)
        else:
            for t in temp:
                tempList.append(t+n)
                tempList.append(t-n)
            temp = list(tempList)
            tempList = []

    
    answer = temp.count(target)
    return answer