g0801_0900.s0888_fair_candy_swap.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 g0801_0900.s0888_fair_candy_swap

// #Easy #Array #Hash_Table #Sorting #Binary_Search
// #2023_04_09_Time_318_ms_(100.00%)_Space_39_MB_(100.00%)

class Solution {
    fun fairCandySwap(aliceSizes: IntArray, bobSizes: IntArray): IntArray {
        var aSum = 0
        var bSum = 0
        val ans = IntArray(2)
        for (bar in aliceSizes) {
            aSum += bar
        }
        for (bar in bobSizes) {
            bSum += bar
        }
        val diff: Int = aSum - bSum
        val set: HashSet = HashSet()
        for (bar in aliceSizes) {
            set.add(bar)
        }
        for (bar in bobSizes) {
            if (set.contains(bar + diff / 2)) {
                ans[0] = bar + diff / 2
                ans[1] = bar
                break
            }
        }
        return ans
    }
}