class Solution {
public int minPathSum(int[][] grid) {
if (grid.length == 0) return 0;
if (grid[0].length == 0) return 0;
int row = grid.length;
int col = grid[0].length;
for (int i = 0 ; i < row ; i ++)
{
for (int j = 0 ; j < col ; j ++)
{
if (i == 0 && j == 0)
{
continue;
}
else if (i == 0 && j > 0)
{
grid[i][j] += grid[i][j - 1];
}
else if (i > 0 && j == 0)
{
grid[i][j] += grid[i - 1][j];
}
else
{
grid[i][j] += Math.min(grid[i][j - 1], grid[i - 1][j]);
}
}
}
return grid[row - 1][col - 1];
}
}
Leetcode 64. 最小路径和
最新推荐文章于 2024-04-29 17:36:24 发布