Lv2

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/42746 제한 사항   입출력 예   풀이 import java.util.Arrays;import java.util.stream.Collectors;class Solution { public String solution(int[] numbers) { return Arrays.stream(numbers) .boxed() .sorted((a, b) -> { String strA = String.valueOf(a) + String.valueOf(b); String strB = String..

문제 설명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..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/86971   제한 사항   입출력 예 풀이import java.util.HashMap;import java.util.ArrayList;class Solution { HashMap> numMap = new HashMap(); ArrayList foundList = new ArrayList(); public int solution(int n, int[][] wires) { int answer = Integer.MAX_VALUE; for (int i = 0; i linkedNodeList = new ArrayList(); ..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/131130   제한 사항   입출력 예   풀이import java.util.HashSet;import java.util.ArrayList;class Solution { public int solution(int[] cards) { ArrayList> indexGroupList = new ArrayList(); HashSet checkSet = new HashSet(); for (int i = 0; i indexGroupSet = new HashSet(); int index = i; ..