LeetCode Minimum Path Sum
2014-12-13 12:32
369 查看
链接: https://oj.leetcode.com/problems/minimum-path-sum/
简单的动态规划.
[i][j]表示到达位置(i,j)时的最小sum
public class Solution
{
public int minPathSum(int[][] grid)
{
int n=grid.length;
int m=grid[0].length;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
if(i==0&&j>0)
grid[i][j]+=grid[i][j-1];
if(i>0&&j==0)
grid[i][j]+=grid[i-1][j];
if(i>0&&j>0)
grid[i][j]+=Math.min(grid[i-1][j],grid[i][j-1]);
}
return grid[n-1][m-1];
}
}
简单的动态规划.
[i][j]表示到达位置(i,j)时的最小sum
public class Solution
{
public int minPathSum(int[][] grid)
{
int n=grid.length;
int m=grid[0].length;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
{
if(i==0&&j>0)
grid[i][j]+=grid[i][j-1];
if(i>0&&j==0)
grid[i][j]+=grid[i-1][j];
if(i>0&&j>0)
grid[i][j]+=Math.min(grid[i-1][j],grid[i][j-1]);
}
return grid[n-1][m-1];
}
}
相关文章推荐
- 【LeetCode】 064. Minimum Path Sum
- LeetCode Minimum Path Sum
- 【LeetCode-面试算法经典-Java实现】【064-Minimum Path Sum(最小路径和)】
- leetcode:Minimum Path Sum
- LeetCode | Minimum Path Sum(最小路径和)
- 【LeetCode】Minimum Path Sum
- Minimum Path Sum - LeetCode
- 【LeetCode】Minimum Path Sum
- 【题解】【矩阵】【DP】【Leetcode】Minimum Path Sum
- 【LeetCode】Minimum Path Sum
- 【LeetCode-动态规划】Minimum Path Sum【重要->状态转移方程取最值】
- [leetcode]Minimum Path Sum
- LeetCode题解——Minimum Path Sum
- LeetCode 64 Minimum Path Sum(动态规划)
- leetcode - Minimum Path Sum
- [LeetCode56]Minimum Path Sum
- 【LeetCode】【Python】Minimum Path Sum
- Minimum Path Sum leetcode java
- LeetCode--Minimum Path Sum
- LeetCode算法题——Minimum Path Sum