15 lines
358 B
Go
15 lines
358 B
Go
// Package q120 implements a solution for https://leetcode.com/problems/triangle/
|
|
package q120
|
|
|
|
func minimumTotal(triangle [][]int) int {
|
|
size := len(triangle)
|
|
|
|
for row := size - 2; row >= 0; row-- {
|
|
for i := range triangle[row] {
|
|
triangle[row][i] += min(triangle[row+1][i], triangle[row+1][i+1])
|
|
}
|
|
}
|
|
return triangle[0][0]
|
|
}
|
|
|
|
var _ = minimumTotal
|