Pascal's triangles algorithm based on an iterative aproach

ptiterative.go

func pascalTriangleIterative(row int) []int {
	if row == 1 {
		return []int{1}
	}
	if row == 2 {
		return []int{1, 1}
	}

	out := []int{1, 1}
	for n := 3; n <= row; n++ {
		temp := []int{1}
		for i, j := range out[:len(out)-1] {
			temp = append(temp, j+out[i+1])
		}
		temp = append(temp, 1)
		out = temp
	}
	return out
}