[프로그래머스 코딩테스트] java Lv.0 수열과 구간 쿼리2

 

import java.util.*;
class Solution {
    public int[] solution(int[] arr, int[][] queries) {
        int[] answer = new int[queries.length];
         
        for(int i=0;i<queries.length;i++){   
            int min=-1;
            for(int j = queries[i][0]; j<=queries[i][1];j++){
                if(queries[i][2]<arr[j]){
                    if(min==-1) min =arr[j];
                    if(min>arr[j]){
                        min = arr[j];
                    }
                }
            }
            answer[i]=min;
        }
        return answer;
    }   
}

 

 

 

 

import java.util.*;
class Solution {
    public int[] solution(int[] arr, int[][] queries) {
        int[] answer = new int[queries.length];
         
        for(int i=0;i<queries.length;i++){   
            ArrayList<Integer> list = new ArrayList<Integer>();
            for(int j=queries[i][0]; j<=queries[i][1];j++){
                if(arr[j]>queries[i][2]){
                    list.add(arr[j]);
                }
            }    
            if(list.size()>0){
                Collections.sort(list);
                answer[i] = list.get(0);  
            }
            else{
                answer[i]=-1;  
            }             
        }       
        return answer; 
    }   
}