from itertools import combinations
def solution(numbers, target):
answer = 0
cases = []
indexes = [i for i in range(0, len(numbers))]
for i in range(0, len(numbers)+1):
combs = combinations(indexes, i)
for c in list(combs):
sum = 0
for t in indexes:
if t in c:
sum -= numbers[t]
else:
sum += numbers[t]
if sum == target:
answer += 1
return answer
combinations아니였으면 못풀었겠땅..!
재귀를 활용한 풀이들이 많다
재귀에 익숙해져야겠당