문제 제한사항 문제풀이 class Solution { static int answer; public void dfs(int[] numbers,int target,int idx,int sum){ if(idx == numbers.length){ if(sum == target) answer++; return; } sum+=numbers[idx]; dfs(numbers,target,idx+1,sum); sum-=numbers[idx]*2; dfs(numbers,target,idx+1,sum); } public int solution(int[] numbers, int target) { answer = 0; dfs(numbers,target,0,0); return answer; } } ※ 내 생각 이 문제는 DFS..
