[JAVA 문제 풀이] 배열 뒤집기

public class Solution {
    public int[] solution(int[] num_list) {
        int[] reverse = new int[num_list.length];
        for( int i = 0; i < num_list.length; i++ ) {
            reverse[i] = num_list[num_list.length - i - 1];
        }

        int[] answer = reverse;
        return answer;
    }
}