题目:
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
思路:
还是典型的动态规划问题。定义dp[r][c]表示到达第r - 1行第c - 1列的时候的路径最小和,则递推公式为:dp[r][c] = min(dp[r - 1][c], dp[r][c - 1]) + grid[r - 1][c - 1]。考虑到dp仍然只和与它最近的两个元素有递推关系,所以空间复杂度仍然可以优化到O(min(m, n)),其中m和n分别表示grid的行个数和列个数。为了简便,下面的代码仅仅将空间复杂度优化到O(n),但是做到这一点就足以通过面试官的bar了,进一步提出优化到O(min(m, n))也许会有额外加分。
代码:
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int row = grid.size();
if (row == 0) {
return 0;
}
int col = grid[0].size();
if (col == 0) {
return 0;
}
vector<int> dp(col + 1, INT_MAX);
dp[1] = 0;
for (int r = 1; r <= row; ++r) {
for (int c = 1; c <= col; ++c) {
dp[c] = min(dp[c - 1], dp[c]) + grid[r - 1][c - 1];
}
}
return dp[col];
}
};