g0701_0800.s0781_rabbits_in_forest.Solution.kt Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.32

package g0701_0800.s0781_rabbits_in_forest

// #Medium #Array #Hash_Table #Math #Greedy
// #2023_03_12_Time_132_ms_(100.00%)_Space_34.9_MB_(100.00%)

class Solution {
    fun numRabbits(answers: IntArray): Int {
        val counts = IntArray(1001)
        for (element in answers) {
            counts[element]++
        }
        var answer = counts[0]
        for (i in 1..1000) {
            if (counts[i] > 0) {
                val rabbitsInPartialGroup = counts[i] % (i + 1)
                val rabbitsInCompleteGroups = counts[i] - rabbitsInPartialGroup
                answer += rabbitsInCompleteGroups
                if (rabbitsInPartialGroup > 0) {
                    answer += i + 1
                }
            }
        }
        return answer
    }
}