Notice
Recent Posts
Recent Comments
Link
목록dfs (1)
study record
[프로그래머스-자바] DFS, BFS
타겟넘버 문제 재귀를 활용한 BFS 문제 풀이 public class TargetNumber { public int solution(int[] numbers, int target) { int answer = 0; answer = bfs(numbers, target, numbers[0], 1) + bfs(numbers, target, -numbers[0], 1); return answer; } public int bfs(int[] numbers, int target, int sum, int i) { if(i == numbers.length) { if(sum == target) { return 1; } else { return 0; } } int result = 0; result += bfs(numbers,..
알고리즘
2021. 5. 2. 23:06