1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
| // @Title: 最小路径和 (Minimum Path Sum)
// @Author: 15816537946@163.com
// @Date: 2020-12-02 11:18:11
// @Runtime: 8 ms
// @Memory: 4.3 MB
func minPathSum(grid [][]int) int {
m, n := len(grid), len(grid[0])
dp := make([][]int, m)
for i := range dp {
dp[i] = make([]int, n)
}
dp[0][0] = grid[0][0]
for i := 1; i < n; i++ {
dp[0][i] = grid[0][i] + dp[0][i-1]
}
for i := 1; i < m; i++ {
dp[i][0] = grid[i][0] + dp[i-1][0]
}
for i := 1; i < m; i++ {
for j := 1; j < n; j++ {
dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1])
}
}
return dp[m-1][n-1]
}
func min(a, b int) int {
if a > b {
return b
}
return a
}
|