반응형 코딩테스트 문제집/Programmers(Lv2)10 [Programmers] Lv2: 전화번호 목록(42577) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42577?language=java 풀이(풀이1)더보기import java.util.*;class Solution { public boolean solution(String[] phone_book) { boolean answer = true; Arrays.sort(phone_book); for (int i = 0; i (풀이2)더보기import java.util.*;class Solution { public boolean solution(String[] phone_book) { boolean answ.. 2025. 2. 16. [Programmers] Lv2: 가장 큰 수(42746) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42746?language=java 풀이더보기import java.util.*;class Solution { public String solution(int[] numbers) { String answer = ""; String[] arr = new String[numbers.length]; for (int i = 0; i { int a = Integer.parseInt(o1 + o2); int b = Integer.parseInt(o2 + o1); return Integ.. 2025. 2. 16. [Programmers] Lv2: 이진 변환 반복하기(70129) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/70129?language=java 풀이더보기class Solution { public int[] solution(String s) { int[] answer = new int[]{0, 0}; while (s.length() > 1) { answer[1] += s.length() - s.replace("0", "").length(); s = s.replace("0", ""); int x = s.length(); s = Integer.toBinaryString(x); .. 2025. 2. 12. [Programmers] Lv2: 롤케이크 자르기(132265) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/132265?language=java 풀이더보기import java.util.*;class Solution { public int solution(int[] topping) { int answer = 0; HashMap toppingCount = new HashMap(); for (int i = 0; i toppingChulsu = new HashSet(); for (int i = 0; i 2025. 2. 12. [Programmers] Lv2: 카펫(42842) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42842?language=java 풀이더보기class Solution { public int[] solution(int brown, int yellow) { int[] answer = new int[]{0, 0}; int total = brown + yellow; for (int width = 1; width 2025. 2. 12. [Programmers] Lv2: 점프와 순간 이동(12980) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12980?language=java 풀이더보기import java.util.*;public class Solution { public int solution(int n) { int ans = 0; while (n > 0) { if (n % 2 == 0) { n /= 2; } else { ans += n % 2; n /= 2; } } return ans; }} 2025. 2. 12. [Programmers] Lv2: 2 x n 타일링(12900) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12900?language=java 풀이더보기class Solution { public int solution(int n) { int answer = 0; long[] tile = new long[n + 1]; tile[0] = 0; tile[1] = 1; tile[2] = 2; for (int i = 3; i 2025. 2. 12. [Programmers] Lv2: 피보나치 수(12945) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12945?language=java 풀이더보기class Solution { public int solution(int n) { int answer = 0; int[] fibo = new int[n + 1]; fibo[0] = 0; fibo[1] = 1; for (int i = 2; i 2025. 2. 12. [Programmers] Lv2: 귤 고르기(138476) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/138476?language=java 풀이더보기import java.util.*;class Solution { public int solution(int k, int[] tangerine) { int answer = 0; HashMap tangerineCount = new HashMap(); for (int i : tangerine) { tangerineCount.put(i, tangerineCount.getOrDefault(i, 0) + 1); } ArrayList sor.. 2025. 2. 12. [Programmers] Lv2: 구명보트(42885) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/42885?language=java 풀이더보기import java.util.*;class Solution { public int solution(int[] people, int limit) { int answer = 0; Arrays.sort(people); int i = 0; int j = people.length - 1; while (i 2025. 2. 12. 이전 1 다음 반응형
