Search

60. 배열 조각하기

내 답안
import java.util.*; class Solution { public int[] solution(int[] arr, int[] query) { for(int i =0; i< query.length; i++) { if(i % 2 == 0) { System.out.println(i + " : " ); arr = Arrays.copyOfRange(arr, 0, query[i]+1); }else { arr = Arrays.copyOfRange(arr, query[i], arr.length); } } return arr; } }
Java
복사
다른사람 풀이
import java.util.*; class Solution { public int[] solution(int[] arr, int[] query) { int start = 0; int end = arr.length - 1; for (int i = 0; i < query.length; i++) { if (i % 2 == 0) { end = start + query[i] - 1; } else { start += query[i]; } } return Arrays.copyOfRange(arr, start, end + 2); } }
Java
복사