120.三角形最小路径和.go

/*
 * @lc app=leetcode.cn id=120 lang=golang
 *
 * [120] 三角形最小路径和
 */

// @lc code=start
func minimumTotal(triangle [][]int) int {
	for i := len(triangle)-2; i >= 0; i-- {
		for j:= 0; j < len(triangle[i]); j++ {
			triangle[i][j] += min(triangle[i+1][j], triangle[i+1][j+1])
		}
	}
	return triangle[0][0]
}
func min(a, b int) int {
	if a < b {
		return a
	} else {
		return b
	}
}
// @lc code=end