(프로그래머스)(자바) 타겟 넘버

코딩테스트 연습-깊이/너비 우선 탐색(DFS/BFS)-타겟 넘버

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

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