[Java] K번째수 - Lv1 정렬 프로그래머스 / 프로그래머스 고득점 Kit

https://school.programmers.co.kr/learn/courses/30/lessons/42748

프로그래머스

 

 

풀이

---

import java.util.Arrays;

class Solution{

    public int[] solution(int[] array, int[][] commands) {
        int[] answer = new int[commands.length];
        int ansidx=0;

        for(int i=0; i<commands.length; i++){
            int start = commands[i][0];
            int end = commands[i][1];
            int target = commands[i][2];
            int idx=0;
            int[] arr = new int[end-start+1];
            for(int j=start-1; j<end; j++){
                arr[idx] = array[j];
                idx++;
            }
            Arrays.sort(arr);
            answer[ansidx] = arr[target-1];
            ansidx++;
        }

        return answer;
    }
}