프로그래머스 - [Level 1]코딩테스트 연습 > 정렬 > K번째수

programmers.co.kr/learn/courses/30/lessons/42748?language=java

코딩테스트 연습 - K번째수

 

Solution

//import java.util.Arrays;
 
class Solution {
    private void sortAry(int[] ary){               
        int minIdx;
        for(int i=0 ; i<ary.length-1 ; i++){
            minIdx = i;
            for(int j=i+1 ; j<ary.length ; j++){
                if(ary[minIdx] > ary[j]){
                    minIdx = j;
                }
            }
            
            if(minIdx!=i){
                int tmp = ary[minIdx];
                ary[minIdx] = ary[i];
                ary[i] = tmp;                
            }
        }
    }
    
    public int[] solution(int[] array, int[][] commands) {  
        int[] answer = new int[commands.length];     
        int from, to, k;
        for(int i=0 ; i<commands.length ; i++){            
            from = commands[i][0]-1;
            to = commands[i][1]-1;
            k = commands[i][2]-1;
            
            int cut_len = to-from+1;
            int[] cut = new int[cut_len];
            for(int j=0 ; j<cut_len ; j++){
                cut[j] = array[j+from];
            }
            
            //Arrays.sort(cut);
            sortAry(cut);
            
            answer[i] = cut[k];
        }
        
        return answer;
    }
}