프로그래머스 타겟넘버(복습)

https://school.programmers.co.kr/learn/courses/30/lessons/43165?language=java

프로그래머스

자바로 풀엇고 dfs 문제입니다. 쉽네요

import java.util.*;
class Solution {
   public static int[] gnumbers;
   public static int gtarget;
    public static boolean[] gbCheck;
    public static int gcnt=0;
    public Solution(){
        
    }
    public void dfs(int k,int sum,int cnt){
          
        if(cnt>=gnumbers.length){
            if(sum==gtarget){
                gcnt++;
            }
            
            return ;
        }
        dfs(k+1 , sum + gnumbers[k] , cnt+1 ); 
        dfs(k+1 , sum - gnumbers[k] , cnt+1 ); 
       
        return;
        
    }
    
    public int solution(int[] numbers, int target) {
        int answer = 0;
        Solution s=new Solution();
        gnumbers=numbers;
        
        boolean[] bCheck=new boolean[gnumbers.length];
        gbCheck=bCheck;
        
        gtarget=target;
        
        s.dfs(0,0,0);
        answer=gcnt;
        return answer;
    }
}