[코딩테스트] 타겟 넘버

문제

---

풀이

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int DFS(vector<int> numbers, int target, int death, int sum, int answer);

int solution(vector<int> numbers, int target) {
	int answer = 0;

	answer = DFS(numbers, target, 0, 0, 0);

	return answer;
}

int DFS(vector<int> numbers, int target, int death, int sum, int answer)
{
	if (numbers.size() == death)
	{
		if (sum == target)
		{
			return answer + 1;
		}

		return answer;
	}

	answer = DFS(numbers, target, death + 1, sum + numbers[death], answer);
	answer = DFS(numbers, target, death + 1, sum - numbers[death], answer);

	return answer;
}