밍래그로프 2021. 1. 21. 13:36
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.*;
 
class Solution {
    public int solution(int[] scoville, int k) {
        int answer = 0;
        int first = 0 ;
        int second = 0 ;
        int result = 0 ;
        int index = 0 ; 
        
        while(true){
            Arrays.sort(scoville);
            if(scoville[index] >= k ){
                break;
            }
            if(index<scoville.length-1){
                first = scoville[index];
                scoville[index] = 0;
                second = scoville[index+1*2;
                result = first+second;
                index++;
                scoville[index] = result;
                answer++;                
            }else{
                break;
            }
        }
        if(result < k) answer = -1;
        return answer;
    }
}
 

 

테스트 케이스는 통과 

효율성 테스트는 0점