g0101_0200.s0118_pascals_triangle.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 g0101_0200.s0118_pascals_triangle

// #Easy #Top_Interview_Questions #Array #Dynamic_Programming #Data_Structure_I_Day_4_Array
// #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
// #2022_10_08_Time_277_ms_(33.22%)_Space_34.2_MB_(90.60%)

class Solution {
    fun generate(numRows: Int): List> {
        val output: MutableList> = ArrayList()
        for (i in 0 until numRows) {
            val currRow: MutableList = ArrayList()
            for (j in 0..i) {
                if (j == 0 || j == i || i <= 1) {
                    currRow.add(1)
                } else {
                    val currCell = output[i - 1][j - 1] + output[i - 1][j]
                    currRow.add(currCell)
                }
            }
            output.add(currRow)
        }
        return output
    }
}