[프로그래머스]n 번째 원소부터

class Solution {
    public int[] solution(int[] num_list, int n) {
        int[] answer = new int[num_list.length - (n-1)];

        for (int i = (n-1), j =0; j < answer.length; i++, j++) {
            answer[j] = num_list[i];
        }

        return answer;
    }
}