BFS

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/159993제한 사항입출력 예풀이def solution(maps): answer = 0 row_size = len(maps) col_size = len(maps[0]) start = [[-1, -1]] lever = [[-1, -1]] for r in range(row_size): for c in range(col_size): if maps[r][c] == 'S': start = [[r, c]] elif maps[r][c] == 'L': lever =..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/81302   제한 사항   입출력 예   풀이import java.util.HashMap;import java.util.ArrayList;class Solution { HashMap nodeMap; public int[] solution(String[][] places) { int[] answer = new int[places.length]; for (int i = 0; i (); ArrayList pList = new ArrayList(); for (int y = 0; y    후기맨해튼 거리가..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/43162 제한 사항 입출력 예 풀이import java.util.ArrayList;import java.util.HashMap;class Solution { int answer = 0; HashMap nodeMap = new HashMap(); ArrayList closedList = new ArrayList(); public int solution(int n, int[][] computers) { for (int i = 0; i connectedList = new ArrayList(); public void setconn..

문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/181921 제한 사항 입출력 예 풀이 import java.util.ArrayList; class Solution { ArrayList result = new ArrayList(); public int[] solution(int l, int r) { doDfs(5, l, r); return result.size() == 0 ? new int[] { -1 } : result.stream().sorted().mapToInt(i -> i).toArray(); } private void doDfs(int num, int l, int r) { if (num = l) result.add(num); d..

문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/1844 제한 사항 입출력 예 풀이 import java.util.HashSet; class Solution { HashSet openSet = new HashSet(); HashSet closedSet = new HashSet(); HashSet newOpenSet; public int solution(int[][] maps) { openSet.add(0); // 출발지 return doBfs(maps, 1); } public int doBfs(int[][] maps, int answer) { newOpenSet = new HashSet(); int count = 0; for (Intege..

문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/43165 제한 사항 입출력 예 풀이 class Solution { int answer = 0; int[] numbers; int target; public int solution(int[] numbers, int target) { this.numbers = numbers; this.target = target; doDfs(0, 0); return answer; } public void doDfs(int index ,int result) { int result1 = result + numbers[index]; int result2 = result - numbers[index]; if (ind..