본문 바로가기

알고리즘 & 자료구조/프로그래머스132

체육복 package programmers; import java.util.Arrays; public class 체육복 { private static boolean[] lostCheck; private static boolean[] reserveCheck; public static int solution(int n, int[] lost, int[] reserve) { initBooleanArrays(lost, reserve); arraysSort(lost, reserve); return n - lostCheck.length + countSelf(lost, reserve) + countReserve(lost, reserve); } private static int countReserve(int[] lost, in.. 2022. 11. 9.
다트 게임 package programmers; import java.util.Arrays; public class 다트게임 { public static int solution(String dartResult) { int[] points = new int[3]; int cnt = 0; int tmp = 0; for (int i = 0; i < dartResult.length(); i++) { char c = dartResult.charAt(i); if (isPoint(c)) { points[cnt++] = pointCalc(c, Integer.parseInt(dartResult.substring(tmp, i))); tmp = i + 1; } tmp = getBonus(dartResult, points, cnt, t.. 2022. 11. 8.
실패율 package programmers; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.List; public class 실패율 { public static int[] solution(int N, int[] stages) { HashMap map = getMap(N, stages); List list = new ArrayList(map.keySet()); sortByValue(map, list); return listToIntArray(list); } private static int[] listToIntArray(List list) { int[] answer = new int[lis.. 2022. 11. 6.
소수 만들기 package programmers; import java.util.Arrays; public class 소수만들기 { private static boolean[] isPrime; public static void findPrime(int n) { isPrime = new boolean[n + 1]; Arrays.fill(isPrime, true); for (int i = 2; i 2022. 11. 4.
소수찾기 package programmers; import java.util.Arrays; public class 소수찾기 { private static boolean[] isPrime; public static int solution(int n) { isPrime = new boolean[n + 1]; Arrays.fill(isPrime, true); for (int i = 2; i 2022. 11. 2.
모의고사 package programmers; import java.util.ArrayList; import java.util.Arrays; import java.util.List; public class 모의고사 { private static int[] one = {1, 2, 3, 4, 5}; private static int[] two = {2, 1, 2, 3, 2, 4, 2, 5}; private static int[] three = {3, 3, 1, 1, 2, 2, 4, 4, 5, 5}; public static int[] solution(int[] answers) { int oneCnt = 0, twoCnt = 0, threeCnt = 0; for (int i = 0; i < answers.length;.. 2022. 11. 1.

티스토리툴바