LeetCode 64. Minimum Path Sum
2017-09-17 22:04
197 查看
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.
Note: You can only move either down or right at any point in time.
用一个dp二维数组标记当前方格的最小值0.当i == 0 && j == 0的时候,dp[i][j] = grid[i][j]; 1.对于i==0的时候,为最上面一排,当前方格只能由左边方格来,所以dp[i][j] = dp[i][j-1] + grid[i][j]; 2.对于j==0的时候,为最左边一排,当前方格只能由上边方格来,所以dp[i][j] = dp[i-1][j] + grid[i][j]; 3.其他情况下,dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j]; 最后直到一直递推输出到终点(m-1, n-1)的时候return dp[m-1][n-1];
class Solution { public: int minPathSum(vector<vector<int>>& grid) { int n=grid.size(),m=grid[0].size(); int dp [m]; for(int i=0;i<n;i++){ for(int j=0;j<m;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-1][j],dp[i][j-1])+grid[i][j]; } } return dp[n-1][m-1]; } };
相关文章推荐
- LeetCode 64. Minimum Path Sum (Python)最优解--Apolo_Shane
- Leetcode 64. Minimum Path Sum (Medium) (cpp)
- 【leetcode】64. Minimum Path Sum
- Leetcode - Dynamic Progr - 64. Minimum Path Sum(BFS+DP)
- Leetcode: 64. Minimum Path Sum
- 个人记录-LeetCode 64. Minimum Path Sum
- [Leetcode] 64. Minimum Path Sum
- [LeetCode] 64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- 【leetcode】64. Minimum Path Sum【java】
- leetcode No64. Minimum Path Sum
- Leetcode:64. Minimum Path Sum
- [LeetCode]64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- [LeetCode]--64. Minimum Path Sum
- DP问题—Leetcode 64. Minimum Path Sum
- (Java)LeetCode-64. Minimum Path Sum
- 【leetcode】64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- leetcode64. Minimum Path Sum