Algorithm/Programmers259 [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 / 배열 만들기 3 / Java 문제 풀이 import java.util.Arrays; class Solution { public int[] solution(int[] arr, int[][] intervals) { int[] interval1 = Arrays.copyOfRange(arr, intervals[0][0], intervals[0][1] + 1); int[] interval2 = Arrays.copyOfRange(arr, intervals[1][0], intervals[1][1] + 1); int[] answer = new int[interval1.length + interval2.length]; System.arraycopy(interval1, 0, answer, 0, interval1.length); System.array.. 2023. 12. 5. [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. [Programmers] Lv.0 / 가까운 1 찾기 / Java 문제 풀이 class Solution { public int solution(int[] arr, int idx) { int answer = 0; for(int i = idx; i < arr.length; i++) { if(arr[i] == 1) { answer = i; break; } else { answer = -1; } } return answer; } } class Solution { public int solution(int[] arr, int idx) { int answer = -1; for(int i = idx; i < arr.length; i++) { if(arr[i] == 1) { answer = i; break; } } return answer; } } class Solution { pu.. 2023. 12. 4. [Programmers] Lv.0 / 카운트 다운 / Java 문제 풀이 class Solution { public int[] solution(int start, int end) { int[] answer = new int[start - end + 1]; for(int i = 0; i -i) .toArray(); } } 출처 https://school.programmers.co.kr/lea.. 2023. 12. 1. [Programmers] Lv.0 / 글자 지우기 / Java 문제 풀이 class Solution { public String solution(String my_string, int[] indices) { String answer = ""; String[] tmp = my_string.split(""); for(int i = 0; i < indices.length; i++) { tmp[indices[i]] = ""; } for(String str : tmp) { answer += str; } return answer; } } import java.util.*; class Solution { public String solution(String my_string, int[] indices) { String answer = ""; int x = 0; Arrays.so.. 2023. 12. 1. 이전 1 ··· 20 21 22 23 24 25 26 ··· 29 다음
