[알고리즘문제풀기] n 번째 원소부터

문제

내가 작성한 정답

import java.util.Arrays;

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];
        int idx = 0;
        for(int i=n-1; i< num_list.length; i++){
            answer[idx++] = num_list[i];
        }
        return answer;
    }
}