[LeetCode] Minimum Path Sum

最新推荐文章于 2015-04-08 17:26:45 发布

转载最新推荐文章于 2015-04-08 17:26:45 发布 · 44 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/changchengxiao/p/3417930.html

本文针对一个m x n网格中寻找从左上角到右下角的路径问题进行了详细的解答，该路径需使得所有经过数字之和最小。采用动态规划的方法，通过从上到下、从左到右的方式进行计算，最终找到最优路径。

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，从上往下，从左往右扫一遍即可。

class Solution {
public:
    int minPathSum(vector<vector<int> > &grid) {
    // IMPORTANT: Please reset any member data you declared, as
    // the same Solution instance will be reused for each test case.
    if(grid.size() == 0) return 0;
    int m = grid.size(), n = grid[0].size();
    int **dp = new int*[m];
    for(int i = 0;i < m;i++)
        dp[i] = new int[n];
    
    for(int i = 0;i < m;i++)
    {
        for(int j = 0;j < n;j++)
        {
            if(i == 0)
            {
                if(j == 0) dp[i][j] = grid[i][j];
                else 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 - 1][j], dp[i][j - 1]) + grid[i][j];
            }
        }
    }
    
    return dp[m - 1][n - 1];
    }
};

转载于:https://www.cnblogs.com/changchengxiao/p/3417930.html