![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/43163 제한 사항 입출력 예 풀이import java.util.List;import java.util.ArrayList;import java.util.HashSet;class Solution { ArrayList wordList = new ArrayList(); HashSet check = new HashSet(); public int solution(String begin, String target, String[] words) { return bfs(List.of(begin), words, target, 0); } priv..
![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/12927 제한 사항 입출력 예 풀이import java.util.PriorityQueue;class Solution { public long solution(int n, int[] works) { long answer = 0; PriorityQueue result = new PriorityQueue((i, j) -> j - i); for (int work : works) result.add(work); while (n-- > 0) result.add(result.poll() - 1); for (int..
![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/258709 제한 사항 입출력 예 풀이import java.util.List;import java.util.ArrayList;import java.util.Map;import java.util.HashMap;import java.util.PriorityQueue;import static java.util.Map.Entry;class Solution { int[] answer = {}; int max = 0; public int[] solution(int[][] dice) { selectDices(new ArrayList(), dice, -1, di..
![]()
문제 설명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/77485 제한 사항 입출력 예 풀이class Solution { public int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int[queries.length]; int[][] data = new int[rows][columns]; int count = 1; for (int i = 0; i start[0]; y--) { min = Math.min(min, data[y - 1][end[1]]); i..
![]()
문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/147354 제한 사항 입출력 예 풀이import java.util.Arrays;import java.util.Comparator;class Solution { public int solution(int[][] data, int col, int row_begin, int row_end) { int answer = 0; // 2 Arrays.sort(data, Comparator.comparing((int[] arr) -> arr[col - 1]) .thenComparing((in..
