반응형 Programmers78 [Programmers] Lv1: 3진법 뒤집기(68935) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/68935?language=java 풀이더보기더보기import java.util.*;class Solution { public int solution(int n) { int answer = 0; ArrayList list = new ArrayList(); while (n > 0) { list.add(n % 3); n /= 3; } int m = 1; for (int i = list.size() - 1; i >= 0; --i) { answ.. 2025. 2. 11. [Programmers] Lv1: 두 개 뽑아서 더하기(68644) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/68644?language=java 풀이더보기더보기import java.util.HashSet;class Solution { public int[] solution(int[] numbers) { HashSet set = new HashSet(); for (int i = 0; i 2025. 2. 11. [Programmers] Lv1: 키패드 누르기(67256) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/67256?language=java 풀이더보기 2025. 2. 11. [Programmers] Lv1: 크레인 인형뽑기 게임 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/64061?language=java 풀이더보기더보기import java.util.Stack;class Solution { public int solution(int[][] board, int[] moves) { Stack[] lanes = new Stack[board.length]; for (int i = 0; i (); } for (int i = board.length - 1; i >= 0; --i) { for (int j = 0; j 0) { lanes[j].p.. 2025. 2. 11. [Programmers] Lv1: 실패율(42889) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42889?language=java 풀이더보기더보기import java.util.HashMap;class Solution { public int[] solution(int N, int[] stages) { int[] challenger = new int[N + 2]; for (int i = 0; i fails = new HashMap(); double total = stages.length; for (int i = 1; i Double.compare(o2.getValue(), o1.getValue())).mapToI.. 2025. 2. 11. [Programmers] Lv1: 모의고사(42840) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42840 풀이더보기더보기import java.util.ArrayList;import java.util.Arrays;class Solution { public int[] solution(int[] answers) { int[][] pattern = { {1, 2, 3, 4, 5}, {2, 1, 2, 3, 2, 4, 2, 5}, {3, 3, 1, 1, 2, 2, 4, 4, 5, 5} }; int[] scores = new int[3]; for (in.. 2025. 2. 11. [Programmers] Lv1: K번째 수 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42748 풀이(풀이1)더보기import java.util.Arrays;class Solution { public int[] solution(int[] array, int[][] commands) { int[] answer = new int[commands.length]; for (int c = 0; c (풀이2)더보기import java.util.*;class Solution { public int[] solution(int[] array, int[][] commands) { int[] answer = new int[comm.. 2025. 2. 11. [Programmers] Lv1: 완주하지 못한 선수(42576) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42576 풀이더보기더보기import java.util.HashMap;public class Solution { public String solution(String[] participant, String[] completion) { HashMap hashMap = new HashMap(); for (String string : completion) { hashMap.put(string, hashMap.getOrDefault(string, 0) + 1); } for (String string : participan.. 2025. 2. 11. [Programmers] 비밀지도(17681) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/17681 풀이더보기 2025. 2. 11. [Programmers] Lv1: 예산(12982) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12982 풀이더보기import java.util.*;class Solution { public int solution(int[] d, int budget) { int answer = 0; Arrays.sort(d); for (int i = 0; i 2025. 2. 11. 이전 1 2 3 4 5 6 7 8 다음 반응형
