[LeetCode] 1688. Count of Matches in Tournament

문제 보기

Kotlin

class Solution {
    fun numberOfMatches(n: Int): Int {
        var remains = n
        var cnt = 0
        
        while (remains > 1) {
            if (remains % 2 == 0) {
                cnt += remains / 2
                remains /= 2
            } else {
                cnt += (remains - 1) / 2
                remains = (remains - 1) / 2 + 1
            }
        }
        
        return cnt
    }
}

#KotlinAlgorithmLeetCodeSimulation