58 lines
1.5 KiB
Go
58 lines
1.5 KiB
Go
|
package x
|
||
|
|
|
||
|
|
import "testing"
|
||
|
|
|
||
|
|
func TestMinPathSum(t *testing.T) {
|
||
|
|
grid := [][]int{
|
||
|
|
{3, 8, 6, 0, 5, 9, 9, 6, 3, 4, 0, 5, 7, 3, 9, 3},
|
||
|
|
{0, 9, 2, 5, 5, 4, 9, 1, 4, 6, 9, 5, 6, 7, 3, 2},
|
||
|
|
{8, 2, 2, 3, 3, 3, 1, 6, 9, 1, 1, 6, 6, 2, 1, 9},
|
||
|
|
{1, 3, 6, 9, 9, 5, 0, 3, 4, 9, 1, 0, 9, 6, 2, 7},
|
||
|
|
{8, 6, 2, 2, 1, 3, 0, 0, 7, 2, 7, 5, 4, 8, 4, 8},
|
||
|
|
{4, 1, 9, 5, 8, 9, 9, 2, 0, 2, 5, 1, 8, 7, 0, 9},
|
||
|
|
{6, 2, 1, 7, 8, 1, 8, 5, 5, 7, 0, 2, 5, 7, 2, 1},
|
||
|
|
{8, 1, 7, 6, 2, 8, 1, 2, 2, 6, 4, 0, 5, 4, 1, 3},
|
||
|
|
{9, 2, 1, 7, 6, 1, 4, 3, 8, 6, 5, 5, 3, 9, 7, 3},
|
||
|
|
{0, 6, 0, 2, 4, 3, 7, 6, 1, 3, 8, 6, 9, 0, 0, 8},
|
||
|
|
{4, 3, 7, 2, 4, 3, 6, 4, 0, 3, 9, 5, 3, 6, 9, 3},
|
||
|
|
{2, 1, 8, 8, 4, 5, 6, 5, 8, 7, 3, 7, 7, 5, 8, 3},
|
||
|
|
{0, 7, 6, 6, 1, 2, 0, 3, 5, 0, 8, 0, 8, 7, 4, 3},
|
||
|
|
{0, 4, 3, 4, 9, 0, 1, 9, 7, 7, 8, 6, 4, 6, 9, 5},
|
||
|
|
{6, 5, 1, 9, 9, 2, 2, 7, 4, 2, 7, 2, 2, 3, 7, 2},
|
||
|
|
{7, 1, 9, 6, 1, 2, 7, 0, 9, 6, 6, 4, 4, 5, 1, 0},
|
||
|
|
{3, 4, 9, 2, 8, 3, 1, 2, 6, 9, 7, 0, 2, 4, 2, 0},
|
||
|
|
{5, 1, 8, 8, 4, 6, 8, 5, 2, 4, 1, 6, 2, 2, 9, 7},
|
||
|
|
}
|
||
|
|
|
||
|
|
result := minPathSum(grid)
|
||
|
|
|
||
|
|
t.Log("result:", result)
|
||
|
|
}
|
||
|
|
|
||
|
|
func minPathSum(grid [][]int) int {
|
||
|
|
return sum(grid, len(grid)-1, len(grid[0])-1)
|
||
|
|
}
|
||
|
|
|
||
|
|
func sum(grid [][]int, x, y int) int {
|
||
|
|
if x == 0 && y == 0 {
|
||
|
|
return grid[x][y]
|
||
|
|
}
|
||
|
|
|
||
|
|
if x == 0 {
|
||
|
|
return grid[x][y] + sum(grid, x, y-1)
|
||
|
|
}
|
||
|
|
|
||
|
|
if y == 0 {
|
||
|
|
return grid[x][y] + sum(grid, x-1, y)
|
||
|
|
}
|
||
|
|
|
||
|
|
return grid[x][y] + _min(sum(grid, x-1, y), sum(grid, x, y-1))
|
||
|
|
}
|
||
|
|
|
||
|
|
func _min(a, b int) int {
|
||
|
|
if a < b {
|
||
|
|
return a
|
||
|
|
}
|
||
|
|
return b
|
||
|
|
}
|