lavos/cap4/ex24.go

package cap4

// Ex24 树塔问题
func Ex24(nums [][]int) (int, []int) {
	steps := make([]int, 0)

	dp := make([][]int, len(nums))
	for i, layer := range nums {
		dp[i] = make([]int, len(layer))
		copy(dp[i], layer)
	}

	for i := len(nums) - 2; i >= 0; i-- {
		layer := nums[i]
		for j := range layer {
			// 取最大的两个来源（下层同位置和下层同位置+1）
			dp[i][j] += max(dp[i+1][j], dp[i+1][j+1])
		}
	}

	return dp[0][0], steps
}