[Java]프로그래머스 Lv. 0 배열 뒤집기

https://school.programmers.co.kr/learn/courses/30/lessons/120821

프로그래머스

나의 풀이

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

다른 풀이

import java.util.Collections;
import java.util.List;
import java.util.stream.Collectors;
import java.util.Arrays;

class Solution {
    public int[] solution(int[] numList) {
        List<Integer> list = Arrays.stream(numList).boxed().collect(Collectors.toList());

        Collections.reverse(list);
        return list.stream().mapToInt(Integer::intValue).toArray();
    }
}