<div id="readability-page-1" class="page"><div><img src="https://velog.velcdn.com/images/psj0810/post/a9cf9235-b199-4827-80d6-dd1ceea3539d/image.png"> 
내풀이
<pre><code>import java.util.*;

class Solution {
 public int[] solution(int[] num_list) {
 int[] answer = Arrays.copyOf(num_list,num_list.length+1);

 int lastInt = answer[num_list.length-1];
 int secondInt = answer[num_list.length-2];

 int addInt = lastInt &gt; secondInt ? lastInt-secondInt : lastInt*2;
 
 answer[num_list.length] = addInt;
 
 return answer;
 }
}</code></pre>
<img src="https://velog.velcdn.com/images/psj0810/post/8bda3baf-c005-4b1e-ae90-bdaffc122cba/image.png">
블로그출처 : <a href="https://sno-machinelearning.tistory.com/18">https://sno-machinelearning.tistory.com/18</a></div></div>

psj.log

내풀이
import java.util.*;
class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = Arrays.copyOf(num_list,num_list.length+1);
        int lastInt = answer[num_list.length-1];
        int secondInt = answer[num_list.length-2];
        int addInt = lastInt > secondInt ? lastInt-secondInt : lastInt*2;
        answer[num_list.length] = addInt;
        return answer;
    }
}
블로그출처 : https://sno-machinelearning.tistory.com/18

마지막 두 원소 (Arrays.copyOf)

댓글