반응형 분류 전체보기267 [Programmers] Lv1: 로또의 최고 순위와 최저 순위(77484) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/77484?language=java 풀이더보기class Solution { public int[] solution(int[] lottos, int[] win_nums) { int zero = 0; int matched = 0; for (int l : lottos) { if (l == 0) zero++; else { for (int w : win_nums) { if (l == w) { match.. 2025. 2. 11. [Programmers] Lv1: 음양 더하기(76501) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/76501?language=java 풀이더보기class Solution { public int solution(int[] absolutes, boolean[] signs) { int answer = 0; for (int i = 0; i 2025. 2. 11. [Programmers] Lv1: 신규 아이디 추천(72410) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/72410?language=java 풀이더보기 2025. 2. 11. [Programmers] Lv1: 내적(70128) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/70128?language=java 풀이더보기더보기class Solution { public int solution(int[] a, int[] b) { int answer = 0; for (int i = 0; i 2025. 2. 11. [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: 체육복(42862) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42862?language=java 풀이더보기 2025. 2. 11. 이전 1 ··· 17 18 19 20 21 22 23 ··· 27 다음 반응형
