g1601_1700.s1686_stone_game_vi.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 g1601_1700.s1686_stone_game_vi

// #Medium #Array #Math #Sorting #Greedy #Heap_Priority_Queue #Game_Theory
// #2023_06_15_Time_702_ms_(100.00%)_Space_57.9_MB_(100.00%)

import java.util.PriorityQueue

class Solution {
    private class Pair internal constructor(var a: Int, var b: Int) : Comparable {
        var sum: Int

        init {
            sum = a + b
        }

        override fun compareTo(other: Pair): Int {
            return other.sum - sum
        }
    }

    fun stoneGameVI(aliceValues: IntArray, bobValues: IntArray): Int {
        val pq = PriorityQueue()
        for (i in aliceValues.indices) {
            pq.add(Pair(aliceValues[i], bobValues[i]))
        }
        var turn = true
        var a = 0
        var b = 0
        while (pq.isNotEmpty()) {
            if (turn) {
                a += pq.poll().a
            } else {
                b += pq.poll().b
            }
            turn = !turn
        }
        return Integer.compare(a, b)
    }
}