Files
Hot-100-Algorithm/动态规划/杨辉三角/main.go
JACKYMYPERSON 14a6771b9a 增加新题目
2025-09-01 20:17:03 +08:00

30 lines
627 B
Go

package main
func main() {
}
func generate(numRows int) [][]int {
reslist := make([][]int, 0)
for i := 0; i < numRows; i++ {
tmpnumlist := make([]int, 0)
if i == 0 {
tmpnumlist = append(tmpnumlist, 1)
reslist = append(reslist, tmpnumlist)
continue
}
for j := 0; j < i+1; j++ {
if j-1 < 0 {
tmpnumlist = append(tmpnumlist, reslist[i-1][0])
continue
} else if j == len(reslist[i-1]) {
tmpnumlist = append(tmpnumlist, reslist[i-1][j-1])
continue
}
tmpnumlist = append(tmpnumlist, reslist[i-1][j]+reslist[i-1][j-1])
}
reslist = append(reslist, tmpnumlist)
}
return reslist
}