题目:
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.
题意:给定一个m*n大小的网格,从网格左上角到右下角的所有路径中,求所有路径中数字和最小,并返回。
思路:
DP问题,(动态规划法)。网格第0行与第0列直接累加,其他格只需要选择其上面和左面的格子最小值,并加上格子本身的数字和即可。
代码如下:16ms
class Solution { public: int minPathSum(vector<vector<int>>& grid) { int m = grid.size(); int n = grid[0].size(); vector<vector<int>> result(m, vector<int>(n, 0)); result[0][0] = grid[0][0]; for(int i=1; i<m; i++){ result[i][0] = grid[i][0]+result[i-1][0]; } for(int i=1; i<n; i++){ result[0][i] = grid[0][i]+result[0][i-1]; } for(int i=1; i<m; i++){ for(int j=1; j<n; j++){ result[i][j] += (result[i-1][j]>result[i][j-1] ? result[i][j-1] : result[i-1][j]) + grid[i][j]; } } return result[m-1][n-1]; } };优化以上代码的空间复杂度之后的代码如下:12ms
class Solution { public: int minPathSum(vector<vector<int>>& grid) { int m = grid.size(); int n = grid[0].size(); vector<int> result(m, grid[0][0]); for(int i=1; i<m; i++){ result[i] = result[i-1] + grid[i][0]; } for(int i=1; i<n; i++){ result[0] += grid[0][i]; for(int j=1; j<m; j++){ result[j] = min(result[j-1], result[j])+grid[j][i]; } } return result[m-1]; } };