triangle.go

// https://leetcode.com/problems/triangle/

func minimumTotal(triangle [][]int) int {
    if len(triangle) == 0 {
        return 0
    }
    
    height := len(triangle)
    width := len(triangle[height - 1])
    memorized := make([]int, width)
    copy(memorized, triangle[height - 1])
    
    for i := height - 2; i >= 0; i-- {
        row := triangle[i]
        
        for j, val := range row {
            memorized[j] = min(memorized[j] + val, memorized[j + 1] + val)
        }
    }
    
    return memorized[0]
}

func min(a, b int) int {
    if a < b {
        return a
    }
    
    return b
}