g2701_2800.s2748_number_of_beautiful_pairs.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 g2701_2800.s2748_number_of_beautiful_pairs

// #Easy #Array #Math #Number_Theory #2023_08_08_Time_227_ms_(100.00%)_Space_38.5_MB_(100.00%)

class Solution {
    fun countBeautifulPairs(nums: IntArray): Int {
        var beautifulPairs = 0
        var i = 0
        var j = 1
        while (i < nums.size - 1) {
            val firstDigit = getFirstDigit(nums[i])
            while (j < nums.size) {
                val lastDigit = nums[j] % 10
                val botDigitsAreEqualAndNot1 = firstDigit == lastDigit && firstDigit > 1
                val botDigitsAreDivisibleBy2 = firstDigit % 2 == 0 && lastDigit % 2 == 0
                val botDigitsAreDivisibleBy3 = firstDigit % 3 == 0 && lastDigit % 3 == 0

                if (!botDigitsAreEqualAndNot1 && !botDigitsAreDivisibleBy2 && !botDigitsAreDivisibleBy3) {
                    beautifulPairs++
                }
                j++
            }
            i++
            j = i + 1
        }
        return beautifulPairs
    }

    private fun getFirstDigit(num: Int): Int {
        var n = num
        var digit = 0
        while (n > 0) {
            digit = n % 10
            n /= 10
        }
        return digit
    }
}