class Solution {
    public int[] solution(int[] num_list, int n) {
        int[] answer = {};
        return answer;
    }
}

---

해결법

방법 1

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

• Arrays.copyOfRange()

  참고: 배열, ArrayList - (2) Arrays.copyOfRange()

방법 2

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

• for 문
  • Arrays 를 사용하지 않는 방법

---

n 번째 원소부터