[JAVA] [프로그래머스] Level 2 - DFS/BFS - 타겟 넘버

programmers.co.kr/learn/courses/30/lessons/43165

코딩테스트 연습 - 타겟 넘버

 

 

 

 

 

class Solution {
    int answer = 0;
    
    public int solution(int[] numbers, int target) {
        dfs(numbers, 0, 0, target);
        return answer;
    }
    
    public void dfs(int[] numbers, int index, int sum, int target) {
        if(numbers.length == index) {
            if(target == sum)
                answer++;
        }
        else {
            dfs(numbers, index + 1, sum + numbers[index], target);
            dfs(numbers, index + 1, sum - numbers[index], target);
        }
    }
}