题目
解析:
这应该是最简单的一道二维动态规划。还是分成两部分:
- dp数组的初始化:由于这边题目设定只能向下或者向右走,所以grid的第一行和第一列是需要初始化的
- 状态转移方程:dp[i][j] = min(dp[i-1][j],dp[i][j-1])+dp[i][j]
python代码如下:
class Solution:
def minPathSum(self, grid: List[List[int]]) -> int:
# 常规二维dp
m = len(grid)
n = len(grid[0])
dp = [[0]*n for _ in range(m)]
hori = 0
for i in range(m):
hori += grid[i][0]
dp[i][0] = hori
verti = 0
for i in range(n):
verti += grid[0][i]
dp[0][i] = verti
for i in range(1,m):
for j in range(1,n):
dp[i][j] = min(dp[i-1][j],dp[i][j-1]) + grid[i][j]
return dp[m-1][n-1]
状态压缩:因为dp矩阵的每一个值只和左边和上面的值相关,我们可以使用空间压缩将dp数组压缩为 一维。对于第i行,在遍历到第j列的时候,因为第j-1列已经更新过了,所以dp[j-1]代表dp[i][j-1] 的值;而dp[j]待更新,所以当前dp[j]存储的值是在第i-1行的时候计算的,所以代表dp[i-1][j]的值
python代码如下:
class Solution:
def minPathSum(self, grid: List[List[int]]) -> int:
# 状态压缩一维dp
m = len(grid)
n = len(grid[0])
dp = [0]*n
for i in range(m):
for j in range(n):
if i==0 and j==0:
dp[j] = grid[i][j]
elif i==0:
dp[j] = dp[j-1] + grid[i][j]
elif j==0:
dp[j] = dp[j] + grid[i][j]
else:
dp[j] = min(dp[j],dp[j-1]) + grid[i][j]
return dp[-1]
C++版本如下:
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
int n = grid[0].size();
vector<vector<int>> dp(m,vector<int>(n,0));
for (int i=0;i<m;++i){
for (int j=0;j<n;++j){
if (i==0 && j==0){
dp[i][j] = grid[i][j];
}else if (i==0){
dp[i][j] = dp[i][j-1] + grid[i][j];
}else if (j==0){
dp[i][j] = dp[i-1][j] + grid[i][j];
}else{
dp[i][j] = min(dp[i][j-1],dp[i-1][j]) + grid[i][j];
}
}
} return dp[m-1][n-1];
}
};