[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;
    }
}

class Solution {
    public int[] solution(int[] num_list, int n) {
        int[] answer = new int[num_list.length - n + 1];
        for(int i = n - 1; i < num_list.length; i++) {
            answer[i - n + 1] = num_list[i];     
        }
        return answer;
    }
}

 

출처

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