반응형 Programmers105 [Programmers] Lv0: 캐릭터의 좌표(120861) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/120861?language=java 풀이더보기class Solution { public int[] solution(String[] keyinput, int[] board) { int[] answer = new int[2]; int x = 0; int y = 0; int minX = -board[0] / 2; int maxX = board[0] / 2; int minY = -board[1] / 2; int maxY = board[1] / 2; for (int i = 0; i = min.. 2025. 2. 12. [Programmers] Lv3: 정수 삼각형(43105) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/43105?language=java 풀이더보기 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] Lv3: 기지국 설치(12979) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12979?language=java 풀이더보기class Solution { public int solution(int n, int[] stations, int w) { int answer = 0; int location = 1; int i = 0; while (location = stations[i] - w) { location = stations[i] + w + 1; i++; } else { location += 2 *.. 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. [Programmers] Lv1: 나머지가 1이 되는 수 찾기(87389) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/87389?language=java 풀이더보기class Solution { public int solution(int n) { int answer = 0; for (int x = 1; x 2025. 2. 11. [Programmers] Lv1: 최소직사각형(86491) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/86491?language=java 풀이더보기class Solution { public int solution(int[][] sizes) { int answer = 0; int maxWidth = 0; int maxHeight = 0; for (int i = 0; i sizes[i][1]) { if (maxWidth 2025. 2. 11. [Programmers] Lv1: 없는 숫자 더하기(86051) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/86051?language=java 풀이더보기class Solution { public int solution(int[] numbers) { int answer = 0; for (int i = 0; i 2025. 2. 11. 이전 1 2 3 4 5 6 7 8 ··· 11 다음 반응형
