문제 링크 : 프로그래머스 - 깊이/너비 우선 탐색 > 타겟 넘버
def solution(numbers, target):
head = [0]
for number in numbers:
node = []
for i in head:
node.append(i + number)
node.append(i - number)
head = node
return node.count(target)
function solution(numbers, target) {
var head = [0];
for (let n of numbers){
let child = [];
for (let node of head){
child.push(node + n);
child.push(node - n);
}
head = child;
}
return head.filter((node) => node == target).length;
}