g0901_1000.s0970_powerful_integers.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 g0901_1000.s0970_powerful_integers

// #Medium #Hash_Table #Math #2023_05_06_Time_136_ms_(100.00%)_Space_35_MB_(100.00%)

import kotlin.math.log10
import kotlin.math.pow

class Solution {
    fun powerfulIntegers(x: Int, y: Int, bound: Int): List {
        val iBound = if (x == 1) 1 else (log10(bound.toDouble()) / log10(x.toDouble())).toInt()
        val jBound = if (y == 1) 1 else (log10(bound.toDouble()) / log10(y.toDouble())).toInt()
        val set: HashSet = HashSet()
        for (i in 0..iBound) {
            for (j in 0..jBound) {
                val number = (x.toDouble().pow(i.toDouble()) + y.toDouble().pow(j.toDouble())).toInt()
                if (number <= bound) {
                    set.add(number)
                }
            }
        }
        return ArrayList(set)
    }
}