Leetcode - Pascal's Triangle II

violet posted @ Apr 06, 2020 07:48:53 AM in 算法 with tags Algorithm Golang array , 241 阅读

Given a non-negative index k where k ≤ 33, return the k^th index row of the Pascal's triangle.

Note that the row index starts from 0.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

func getRow(rowIndex int) []int {
    result := make([]int, rowIndex+1)
    for i := 0; i < len(result); i++ {
        result[i] = 1
    }
    aux := make([]int, rowIndex+1)
    copy(aux, result)
    for i := 1; i < rowIndex; i++ {
        for j := 1; j < i+1; j++ {
            result[j] = aux[j-1] + aux[j]
        }
        copy(aux, result)
    }
    return result
}