반응형 알고리즘101 [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] 다트 게임(17682) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/17682 풀이더보기 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. [Programmers] Lv1: 소수 만들기(12977) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12977 풀이더보기 2025. 2. 11. [Programmers] Lv1: 직사각형 별찍기(12969) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12969 풀이더보기더보기import java.util.Scanner;class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); for (int i = 0; i 2025. 2. 10. [Programmers] Lv1: x만큼 간격이 있는 n개의 숫자(12954) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12954 풀이더보기더보기class Solution { public long[] solution(int x, int n) { long[] answer = new long[n]; long tmp = x; // 숫자범위에 따른 자료형 설정 for (int i = 0; i 2025. 2. 10. [Programmers] Lv1: 행렬의 덧셈(12950) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12950 풀이더보기더보기class Solution { public int[][] solution(int[][] arr1, int[][] arr2) { int[][] answer = new int[arr1.length][arr1[0].length]; for(int i = 0; i 2025. 2. 10. [Programmers] Lv1: 핸드폰 번호 가리기(12948) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12948 풀이더보기더보기class Solution { public String solution(String phone_number) { String answer = ""; for (int i = 0; i 2025. 2. 10. [Programmers] Lv1: 하샤드 수(12947) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12947 풀이더보기더보기class Solution { public boolean solution(int x) { boolean answer = false; int num = x; int sumOfDigits = 0; while (num > 0) { sumOfDigits += num % 10; num /= 10; } if (x % sumOfDigits == 0) { answer = true; } r.. 2025. 2. 10. 이전 1 2 3 4 5 6 7 ··· 11 다음 반응형
