[프로그래머스]배열 뒤집기

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