[Programmers] (깊이/너비 우선 탐색(DFS/BFS)) Lv 2. 타겟 넘버

https://school.programmers.co.kr/learn/courses/30/lessons/43165

프로그래머스

 

#include <string>
#include <vector>

using namespace std;

int dfs(const vector<int>& numbers, const int& target, int order, int res, int answer) {
    if (order >= numbers.size())
        return (res == target) ? answer + 1 : answer;

    answer = dfs(numbers, target, order + 1, res + numbers[order], answer);
    answer = dfs(numbers, target, order + 1, res - numbers[order], answer);
    
    return answer;
}

int solution(vector<int> numbers, int target) {
    return dfs(numbers, target, 0, 0, 0);
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/blob/990e9ee64f05cba07c61c945e5827c76d6cc420d/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/43165.%E2%80%85%ED%83%80%EA%B2%9F%E2%80%85%EB%84%98%EB%B2%84/%ED%83%80%EA%B2%9F%E2%80%85%EB%84%98%EB%B2%84.cpp

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드