문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/92341 제한 사항 입출력 예 풀이 import java.util.HashMap; import java.util.Map; import java.util.ArrayList; class Solution { public int[] solution(int[] fees, String[] records) { ArrayList answer = new ArrayList(); HashMap recordMap = new HashMap(); HashMap result = new HashMap(); final int endOfDay = 23 * 60 + 59; for (int i = 0; i < records...
문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/17684 제한 사항 문제 참고 입출력 예 풀이 import java.util.HashMap; import java.util.ArrayList; class Solution { public int[] solution(String msg) { ArrayList answer = new ArrayList(); HashMap indexMap = new HashMap(); int pre = 0, post = 1; for (int i = 65; i < 91; i++) indexMap.put(String.valueOf((char)i), i - 64); while (post < msg.length()) { ..
문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/87946 제한 사항 입출력 예 풀이 import java.util.ArrayList; class Solution { int answer = 0; public int solution(int k, int[][] dungeons) { ArrayList dungeonList = new ArrayList(); for (int[] dungeon : dungeons) dungeonList.add(dungeon); checkDungeons(k, dungeonList, 0); return answer; } public void checkDungeons(int k, ArrayList dungeonList, ..
문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/42586 제한 사항 입출력 예 풀이 import java.util.ArrayList; class Solution { public int[] solution(int[] progresses, int[] speeds) { ArrayList answer = new ArrayList(); int[] result = new int[progresses.length]; int pre = 0, check = 0; while(check != progresses.length) { check = 0; for (int i = 0; i < progresses.length; i++) { if (progresses[i..
문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/64065 제한 사항 입출력 예 풀이 import java.util.regex.Pattern; import java.util.regex.Matcher; import java.util.ArrayList; import java.util.HashSet; import java.util.stream.Collectors; class Solution { public int[] solution(String s) { ArrayList answer = new ArrayList(); ArrayList result = new ArrayList(); Pattern pattern = Pattern.compile("(..
문제 설명 https://school.programmers.co.kr/learn/courses/30/lessons/120866 제한 사항 입출력 예 풀이 import java.util.ArrayList; import java.util.HashSet; class Solution { public int solution(int[][] board) { int answer = 0; ArrayList bombList = new ArrayList(); HashSet result = new HashSet(); for (int y = 0; y < board.length; y++) for (int x = 0; x < board[y].length; x++) if (board[y][x] == 1) bombList.add(x ..