![](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fctt9Lq%2FbtsJdO35Wwh%2FvCLgw8y2KmhOSx5YV8MZU0%2Fimg.png)
[프로그래머스] 수열과 구간 쿼리 2 - JAVA
·
알고리즘
[작성일: 2023. 10. 08] 풀이import java.util.Arrays;class Solution { public int[] solution(int[] arr, int[][] queries) { int[] answer = new int[queries.length]; Arrays.fill(answer, Integer.MAX_VALUE); for (int i = 0; i queries[i][2]) { if (answer[i] > arr[j]) { answer[i] = Math.min(arr[j], answer[i]); } ..