［アルゴリズム］目標番号(DFS、BFS)

ターゲット番号

def solution(numbers, target):
   
   # DFS
   # 최상단 Node 선언
   visited = [0]
   
   for number in numbers:
       temp =[]
       for i in visited:
           # +1 과 -1 뿐
           temp.append(i+number)
           temp.append(i-number)
           visited = temp
       print(visited)
   return visited.count(target)

             0
        +1     -1
     +1-1     +1 -1
  +1-1 +1-1 +1-1 +1-1
       numbers 만큼

from collections import deque

def solution(numbers, target):
    answer = 0
    queue = deque()
    #최상단노드
    queue.append(0)
    
    for number in numbers:
        for _ in range(len(queue)):
            n = queue.popleft()
            queue.append(n+number)
            queue.append(n-number)
    
    return queue.count(target)