g0201_0300.s0289_game_of_life.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.30

package g0201_0300.s0289_game_of_life

// #Medium #Top_Interview_Questions #Array #Matrix #Simulation
// #2022_11_04_Time_174_ms_(96.97%)_Space_34.2_MB_(93.94%)

class Solution {
    companion object {
        var dim: Array = arrayOf(
            intArrayOf(1, 0), intArrayOf(0, 1), intArrayOf(-1, 0), intArrayOf(0, -1),
            intArrayOf(1, 1), intArrayOf(1, -1), intArrayOf(-1, 1), intArrayOf(-1, -1)
        )
    }

    fun gameOfLife(board: Array) {
        for (i in board.indices) {
            for (j in board[0].indices) {
                val com = compute(board, i, j)
                if (board[i][j] == 0) {
                    if (com == 3) {
                        board[i][j] = -1
                    }
                } else if (board[i][j] == 1 && (com < 2 || com > 3)) {
                    board[i][j] = 2
                }
            }
        }

        update(board)
    }

    private fun update(board: Array) {
        for (i in board.indices) {
            for (j in board[0].indices) {
                if (board[i][j] == -1) {
                    board[i][j] = 1
                } else if (board[i][j] == 2) {
                    board[i][j] = 0
                }
            }
        }
    }

    private fun compute(board: Array, r: Int, c: Int): Int {
        var ret: Int = 0
        for (arr in dim) {
            val row = arr[0] + r
            val col = arr[1] + c
            if (row >= 0 && row < board.size && col >= 0 && col < board[0].size &&
                (board[row][col] == 1 || board[row][col] == 2)
            ) {
                ret++
            }
        }
        return ret
    }
}