https://leetcode.com/problems/pascals-triangle-ii Easy

Решение

class Solution {
    fun getRow(rowIndex: Int): List<Int> {
        val k = rowIndex
        val row = ArrayList<Int>(k + 1)
        var v = 1L
        var i = 0
        while (i <= k) {
            row.add(v.toInt())
            v = v * (k - i) / (i + 1)
            i++
        }
        return row
    }
}