얼거스 개발 일지

내 코드

class Solution {
    public int[] solution(int[] num_list) {
        int idxLast = num_list.length;
        int[] answer = new int[idxLast + 1];
        System.arraycopy(num_list, 0, answer, 0, idxLast);
        
        answer[idxLast] = answer[idxLast - 1] > answer[idxLast - 2]
                        ? answer[idxLast - 1] - answer[idxLast - 2] 
                        : answer[idxLast - 1] * 2;
        return answer;
    }
}