g1101_1200.s1189_maximum_number_of_balloons.Solution.kt Maven / Gradle / Ivy

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.28

package g1101_1200.s1189_maximum_number_of_balloons

// #Easy #String #Hash_Table #Counting #2023_05_25_Time_136_ms_(98.31%)_Space_36.3_MB_(52.54%)

class Solution {
    fun maxNumberOfBalloons(text: String): Int {
        val counts = IntArray(26)
        for (c in text.toCharArray()) {
            counts[c.code - 'a'.code]++
        }
        return Math.min(
            counts[0],
            Math.min(
                counts[1], Math.min(counts[11] / 2, Math.min(counts[14] / 2, counts[13]))
            )
        )
    }
}