[c++/알고리즘] 프로그래머스 타겟넘버

#include <string>
#include <vector>

using namespace std;

int cnt =0, ch[21];

void DFS(vector<int> numbers, int sum, int target, int i){
    int num=0;
    if(i == numbers.size()){
        if(sum == target) cnt++;
    }
    else {
        num = numbers[i];
        i++;
        DFS(numbers, sum + num, target , i);
        DFS(numbers, sum - num, target , i);
    }
}

int solution(vector<int> numbers, int target) {
    int answer = 0;
    int m[2] = {+1, -1};
    int i=0, sum = 0;
    
    DFS(numbers, sum, target, i);
    answer = cnt;
    
    return answer;
}