[Swift 알고리즘] LeetCode 119. Pascal's Triangle II

○

Dynamic Programming | Easy

119. Pascal's Triangle II

class Solution {
    func getRow(_ rowIndex: Int) -> [Int] {
        var row = [1]
        if rowIndex == 0 { return row }

        for i in 1...rowIndex {
            var newRow = Array(repeating: 1, count: i + 1)
            for j in 1..<i {
                newRow[j] = row[j-1] + row[j]
            }
            row = newRow
        }
        return row
    }
}