반응형 알고리즘101 [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] 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 풀이더보기 2025. 2. 12. [Programmers] Lv2: 귤 고르기(138476) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/138476?language=java 풀이더보기 2025. 2. 12. 이전 1 2 3 4 ··· 11 다음 반응형
