본문 바로가기
Algorithm/Programmers

[Programmers] Lv.0 | 배열 뒤집기 | Java

by unknownomad 2025. 11. 1.

문제

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

 

풀이

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 - 1 - i];
        }
        
        return answer;
    }
}

댓글