반응형 코딩테스트 문제집/Programmers(Lv1)56 [Programmers] Lv1: 두 정수 사이의 합(12912) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12912 풀이더보기더보기class Solution { public long solution(int a, int b) { long answer = 0; int minValue = a; int maxValue = b; if (a > b) { minValue = b; maxValue = a; } for (int i = minValue; i 2025. 2. 10. [Programmers] Lv1: 나누어 떨어지는 숫자 배열(12910) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12910 풀이더보기더보기import java.util.*;class Solution { public int[] solution(int[] arr, int divisor) { ArrayList answer = new ArrayList(); for (int i = 0; i Integer.compare(o1, o2)); if (answer.size() == 0) { return new int[]{-1}; } else { return answer.stream().mapToInt(Int.. 2025. 2. 10. [Programmers] Lv1: 같은 숫자는 싫어(12906) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12906 풀이더보기더보기import java.util.*;public class Solution { public int[] solution(int []arr) { ArrayList answer = new ArrayList(); answer.add(arr[0]); for (int i = 1; i 2025. 2. 10. [Programmers] Lv1: 가운데 글자 가져오기(12903) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12903 풀이더보기더보기class Solution { public String solution(String s) { String answer = ""; int n = s.length(); if (n % 2 == 0) { answer += s.charAt(n/2 - 1); answer += s.charAt(n/2); } else { answer += s.charAt(n/2); } return answer; }} 2025. 2. 10. [Programmers] Lv1: 2016년(12901) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12901 풀이더보기 2025. 2. 10. [Programmers] Lv1: 폰켓몬(1845) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/1845 풀이더보기더보기더보기import java.util.Arrays;class Solution { public int solution(int[] nums) { int numsDistinctLength = (int)Arrays.stream(nums).distinct().count(); return Math.min(numsDistinctLength, nums.length / 2); }} 2025. 2. 10. 이전 1 ··· 3 4 5 6 다음 반응형
