[프로그래머스] lv 2 타겟넘버 [DFS] - C++

 

#include <string>
#include <vector>

using namespace std;
int ans=0;
void dfs(vector<int> numbers, int target, int sum, int idx){
    if(idx >= numbers.size()){
        if(sum==target) ans++;
        return ;
    }
    
    dfs(numbers, target, sum+numbers[idx], idx+1);
    dfs(numbers, target, sum-numbers[idx], idx+1);
    
}
int solution(vector<int> numbers, int target) {
    dfs(numbers, target, 0,0);
    return ans;
}