[Programmers] Lv.0 / n개 간격의 원소들 / Java

문제

 

풀이

import java.util.*;

class Solution {
    public int[] solution(int[] num_list, int n) {
        List<Integer> 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_list.length / n + 1;
        int idx = 0;
        int[] answer = new int[N];
        
        for(int i = 0; i < num_list.length; i += n) {
            answer[idx++] = num_list[i];
        }
        return answer;
    }
}

 

출처

https://school.programmers.co.kr/learn/courses/30/lessons/181888