반응형 코딩테스트135 [참고자료] 컴퓨터공학 로드맵 프로그래밍 언어- 버전별 기본 문법 + 공식 문서 + 내부 동작과정 C Language- [Website] 모두의 코드(C): https://modoocode.com/category/C- [교재] C언어 코딩도장(남재윤)- [Website] cppreference: https://en.cppreference.com/w/c C++- [Website] 모두의 코드(C++): https://modoocode.com/category/C++- [교재] 명품 C++ Programming(황기태)- [교재] 포르잔 C++ 바이블(Behrouz A. Forouza)- [Website] cpprefernce: https://en.cppreference.com/w/cpp/language- [Website] cpluspl.. 2025. 3. 2. [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] Lv1: 문자열 나누기(140108) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/140108?language=java 풀이더보기class Solution { public int solution(String s) { int answer = 0; char x = s.charAt(0); int countX = 0; int countY = 0; for (int i = 0; i 2025. 2. 14. [Programmers] Lv1: 가장 가까운 같은 글자(142086) 문제- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/142086?language=java 풀이더보기class Solution { public int[] solution(String s) { int[] answer = new int[s.length()]; for (int i = 0; i 2025. 2. 14. [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. 이전 1 2 3 4 ··· 14 다음 반응형
