[프로그래머스] [JAVA] [Level 2] [깊이/너비 우선 탐색(DFS/BFS)] 타겟 넘버

---

---

class Solution {
    
    int answer = 0;
    
    public void dfs(int numbers[], int target, int depth, int sum){
        
        // 탈출 조건
        if(depth == numbers.length){
            if(target == sum){
                answer++;
            }
            return;
        }
        
        // 수행 동작
        dfs(numbers, target, depth+1, sum + numbers[depth]);
        dfs(numbers, target, depth+1, sum - numbers[depth]);
        
    }
     
    public int solution(int[] numbers, int target) {
        
        dfs(numbers, target, 0, 0);
        return answer;
    }
}

참조