반응형 코딩테스트 문제집73 [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. [Programmers] Lv1: 평균 구하기(12944) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12944 풀이더보기더보기class Solution { public double solution(int[] arr) { double answer = 0; for (int i = 0; i 2025. 2. 10. [Programmers] Lv1: 콜라츠 추측(12943) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12943 풀이더보기더보기class Solution { public int solution(int num) { int answer = 0; long n = num; // 숫자범위 주의! while (n != 1) { answer += 1; if (n % 2 == 0) { n /= 2; } else { n = n * 3 + 1; } if (answer >= 500) { .. 2025. 2. 10. [Programmers] Lv1: 최대공약수와 최소공배수(12940) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12940 풀이더보기더보기class Solution { public int[] solution(int n, int m) { int[] answer = new int[2]; answer[0] = gcd(n, m); answer[1] = n * m / answer[0]; return answer; } private static int gcd(int a, int b) { int r = 0; while (b > 0) { r = a % b; a = b; .. 2025. 2. 10. [Programmers] Lv1: 짝수와 홀수(12937) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12937 풀이더보기더보기class Solution { public String solution(int num) { String answer = ""; if (num % 2 == 0) { answer = "Even"; } else { answer = "Odd"; } return answer; }} 2025. 2. 10. 이전 1 2 3 4 5 6 7 8 다음 반응형
