g2201_2300.s2293_min_max_game.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 g2201_2300.s2293_min_max_game

// #Easy #Array #Simulation #2023_06_28_Time_183_ms_(100.00%)_Space_37.5_MB_(100.00%)

class Solution {
    fun minMaxGame(nums: IntArray): Int {
        val n = nums.size
        if (n == 1) {
            return nums[0]
        }
        val newNums = IntArray(n / 2)
        for (i in 0 until n / 2) {
            if (i % 2 == 0) {
                newNums[i] = Math.min(nums[2 * i], nums[2 * i + 1])
            } else {
                newNums[i] = Math.max(nums[2 * i], nums[2 * i + 1])
            }
        }
        return minMaxGame(newNums)
    }
}