[알고리즘문제풀기] 배열 뒤집기

문제

내가 작성한 정답

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

다른 사람들이 작성한 정답

import java.util.stream.IntStream;

class Solution {
    public int[] solution(int[] num_list) {
        return IntStream.range(0, num_list.length)
                .map(i -> num_list[num_list.length - i - 1])
                .toArray();
    }
}

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

import java.util.stream.LongStream;

class Solution {
    public int[] solution(int[] num_list) {
        return LongStream.range(1, num_list.length + 1)
                .mapToInt(i -> num_list[(int) (num_list.length - i)])
                .toArray();
    }
}