[Kotlin/프로그래머스] 코딩테스트 연습 > 스택/큐 > 기능개발

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
32
33
34
35
36
37
import kotlin.math.ceil

class Solution {
    fun solution(progresses: IntArray, speeds: IntArray): IntArray {
        /*
        day[i] = (100-p[i])/s[i].toFloat
        day[i] = ceil(day[i])
        cnt = 1 temp = day[0]
        for i =1 ~
        if (temp>day[i]) -> cnt ++
        else -> temp = day[i], answer.add(cnt), cnt = 1
        answer.add(cnt)
         */

        val answer = arrayListOf<Int>()
        val n = progresses.size
        val day = IntArray(n)
        for (i in 0 until n) {
            val temp = (100 - progresses[i]) / speeds[i].toFloat()
            day[i] = ceil(temp).toInt()
        }
    
        var temp = day[0]
        var cnt = 1
        for (i in 1 until n) {
            if (temp >= day[i]) {
                cnt++
            } else {
                answer.add(cnt)
                temp = day[i]
                cnt = 1
            }
        }
        answer.add(cnt)
        return answer.toIntArray()
    }
}