g2101_2200.s2126_destroying_asteroids.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 g2101_2200.s2126_destroying_asteroids

// #Medium #Array #Sorting #Greedy #2023_06_25_Time_560_ms_(100.00%)_Space_51.8_MB_(100.00%)

@Suppress("NAME_SHADOWING")
class Solution {
    fun asteroidsDestroyed(mass: Int, asteroids: IntArray): Boolean {
        return helper(mass.toLong(), 0, asteroids)
    }

    private fun helper(mass: Long, startIndex: Int, asteroids: IntArray): Boolean {
        var mass = mass
        var smallOrEqualIndex = partition(mass, startIndex, asteroids)
        if (smallOrEqualIndex < startIndex) {
            return false
        }
        if (smallOrEqualIndex >= asteroids.size - 1) {
            return true
        }
        for (i in startIndex..smallOrEqualIndex) {
            mass += asteroids[i].toLong()
        }
        return helper(mass, ++smallOrEqualIndex, asteroids)
    }

    private fun partition(mass: Long, startIndex: Int, asteroids: IntArray): Int {
        val length = asteroids.size
        var smallOrEqualIndex = startIndex - 1
        for (i in startIndex until length) {
            if (asteroids[i] <= mass) {
                smallOrEqualIndex++
                swap(asteroids, i, smallOrEqualIndex)
            }
        }
        return smallOrEqualIndex
    }

    private fun swap(array: IntArray, i: Int, j: Int) {
        val tmp = array[i]
        array[i] = array[j]
        array[j] = tmp
    }
}