본문 바로가기

codingtest161

[Programmers] Lv.0 / 할 일 목록 / Java 문제 풀이 import java.util.*; class Solution { public String[] solution(String[] todo_list, boolean[] finished) { List unfinishedTasks = new ArrayList(); for(int i = 0; i < todo_list.length; i++) { if(!finished[i]) { unfinishedTasks.add(todo_list[i]); } } String[] answer = unfinishedTasks.toArray(new String[0]); return answer; } } In Java, when using the toArray method with an argument, the argument.. 2024. 1. 9.
[Programmers] Lv.0 / 5명씩 / Java 문제 풀이 class Solution { public String[] solution(String[] names) { int idx = 0; int length = names.length % 5 == 0 ? names.length / 5 : names.length / 5 + 1; String[] answer = new String[length]; for(int i = 0; i < names.length; i += 5) { if(i % 5 == 0) { answer[idx++] = names[i]; } } return answer; } } 출처 https://school.programmers.co.kr/learn/courses/30/lessons/181886 2024. 1. 8.
[Programmers] Lv.0 / 홀수 vs 짝수 / Java 문제 풀이 class Solution { public int solution(int[] num_list) { int evenSum = 0; int oddSum = 0; for(int i = 0; i = oddSum ? evenSum : oddSum; } } class Solution { public int solution(int[] num_list) { int evenSum = 0; int oddSum = 0; for(int i = 0; i < num_list.length; i++) { if(i.. 2024. 1. 5.
[Programmers] Lv.0 / n개 간격의 원소들 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int[] num_list, int n) { List pickedList = new ArrayList(); for(int i = 0; i < num_list.length; i += n) { pickedList.add(num_list[i]); } return pickedList.stream().mapToInt(Integer::intValue).toArray(); } } class Solution { public int[] solution(int[] num_list, int n) { int N = num_list.length % n == 0 ? num_list.length / n : num_l.. 2024. 1. 5.
[Programmers] Lv.0 / n 번째 원소까지 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int[] num_list, int n) { int[] answer = {}; for(int i = 0; i < n; i++) { return Arrays.copyOfRange(num_list, i, n); } return answer; } } import java.util.Arrays; class Solution { public int[] solution(int[] num_list, int n) { return Arrays.copyOfRange(num_list, 0, n); } } 출처 https://school.programmers.co.kr/learn/courses/30/lessons.. 2024. 1. 4.
[Programmers] Lv.0 / 왼쪽 오른쪽 / Java 문제 풀이 import java.util.Arrays; class Solution { public String[] solution(String[] str_list) { String[] answer = {}; for(int i = 0; i < str_list.length; i++) { if(str_list[i].equals("l")) { return Arrays.copyOfRange(str_list, 0, i); } else if(str_list[i].equals("r")) { return Arrays.copyOfRange(str_list, i + 1, str_list.length); } } return answer; // return new String[0]; } } 출처 https://school.pr.. 2024. 1. 3.
[Programmers] Lv.0 / 순서 바꾸기 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int[] num_list, int n) { int[] first = Arrays.copyOfRange(num_list, n, num_list.length); int[] second = Arrays.copyOfRange(num_list, 0, n); int[] answer = new int[first.length + second.length]; System.arraycopy(first, 0, answer, 0, first.length); System.arraycopy(second, 0, answer, first.length, second.length); return answer; } } i.. 2023. 12. 11.
[Programmers] Lv.0 / n 번째 원소부터 / Java 문제 풀이 import java.util.Arrays; class Solution { public int[] solution(int[] num_list, int n) { int[] answer = new int[num_list.length - n + 1]; answer = Arrays.copyOfRange(num_list, n - 1, num_list.length); return answer; } } import java.util.*; class Solution { public int[] solution(int[] num_list, int n) { int[] answer = Arrays.copyOfRange(num_list, n - 1, num_list.length); return answer; } } .. 2023. 12. 11.
[Programmers] Lv.0 / 배열 조각하기 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int[] arr, int[] query) { for(int i =0; i < query.length; i++) { if(i % 2 == 0) { arr = Arrays.copyOfRange(arr, 0, query[i] + 1); } else { arr = Arrays.copyOfRange(arr, query[i], arr.length); } } return arr; } } import java.util.*; class Solution { public int[] solution(int[] arr, int[] query) { int start = 0; int end = arr.length .. 2023. 12. 7.
[Programmers] Lv.0 / 2의 영역 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int[] arr) { int[] answer = {}; List idxList = new ArrayList(); for(int i = 0; i < arr.length; i++) { if(arr[i] == 2) { idxList.add(i); } } if(idxList.size() == 0) { return new int[]{-1}; } int startIdx = idxList.get(0); int endIdx = idxList.get(idxList.size() - 1); answer = Arrays.copyOfRange(arr, startIdx, endIdx + 1); return ans.. 2023. 12. 6.
[Programmers] Lv.0 / 첫 번째로 나오는 음수 / Java 문제 풀이 class Solution { public int solution(int[] num_list) { int answer = 0; for(int i = 0; i < num_list.length; i++) { if(num_list[i] < 0) { answer = i; break; } else { answer = -1; } } return answer; } } class Solution { public int solution(int[] num_list) { for (int i = 0; i < num_list.length; i++) { if (num_list[i] < 0) { return i; } } return -1; } } import java.util.stream.IntStream; class .. 2023. 12. 5.
[Programmers] Lv.0 / 리스트 자르기 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int n, int[] slicer, int[] num_list) { List list = new ArrayList(); int a = slicer[0]; int b = slicer[1]; int c = slicer[2]; if(n == 1) { for(int i = 0; i < b + 1; i++) { list.add(num_list[i]); } } else if(n == 2) { for(int i = a; i< num_list.length; i++) { list.add(num_list[i]); } } else if(n == 3) { for(int i = a; i < b + 1; i++).. 2023. 12. 4.

티스토리툴바