LeetCode-64. 最小路径和

64. Minimum Path Sum

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.
Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

动态规划

状态方程:dp[i][j] = min(dp[i-1][j],dp[i],[j-1])+grid[i][j]
dp动态数组保存每个位置的最优解
第一行和第一列的点只能向右走和向下走，所以首先初始化第一行和第一列，剩下的点用状态方程dp[i][j] = min(dp[i-1][j],dp[i],[j-1])+grid[i][j]，最后返回dp[i-1][j-1];

const static auto io_speed_up = []() {
	std::ios::sync_with_stdio(false);
	cin.tie(nullptr);
	return 0;
}();
class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
    	const int m = grid.size(); //行数
    	const int n = grid[0].size(); //列数
        if(m==1&&n==1) return grid[0][0];
        int dp[m][n];
        dp[0][0] = grid[0][0];
        for(int i=1;i<m;i++) dp[i][0]=dp[i-1][0]+grid[i][0]; //初始化第一列
        for(int i=1;i<n;i++) dp[0][i]=dp[0][i-1]+grid[0][i]; //初始化第一行
        if(m==1) return dp[0][n-1];
        if(n==1) return dp[m-1][0];
        int i,j;
        for(i=1;i<m;i++)
        {
            for(j=1;j<n;j++)
            {
                dp[i][j]=min(dp[i-1][j],dp[i][j-1])+grid[i][j];
            }
        }
        int minx = dp[m-1][n-1];
        return minx;
    }
};