1) 재귀함수 사용한 정답 def dfs(numbers, target, index, current_sum): #끝나는 조건 if index == len(numbers): if current_sum == target: return 1 else: return 0 #내가 원하는 것 positive = dfs(numbers, target, index + 1, current_sum + numbers[index]) negative = dfs(numbers, target, index + 1, current_sum - numbers[index]) return positive + negative def solution(numbers, target): answer = dfs(numbers, target, 0, 0) ret..
