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

문제

내가 작성한 정답

class Solution {
    public int[] solution(int[] num_list) {
        int l = num_list.length;
        for(int i=0; i<l/2; i++){
            int a = num_list[i];
            num_list[i] = num_list[l-i-1];
            num_list[l-i-1] = a;
        }
        return num_list;
    }
}

import java.util.*;
import java.util.stream.*;
class Solution {
    public int[] solution(int[] num_list) {
        List<Integer> list = Arrays.stream(num_list).boxed().collect(Collectors.toList());
        Collections.reverse(list);
        return list.stream().mapToInt(i->i).toArray();
    }
}

다른 사람들의 정답

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