수열과 구간쿼리 2 import java.util.Arrays; class Solution { public int[] solution(int[] arr, int[][] queries) { int len = queries.length; int[] answer = new int[len]; Arrays.fill(answer, -1); for(int i = 0; i < len; i++) { int s = queries[i][0]; int e = queries[i][1]; int k = queries[i][2]; for(int j = s; j k) { answer[i] = answer[i] == -1 ? arr[j] : Math.min(arr[j], answer[i]); } } } return answer; } ..