最小路径和

混吃等死的学混子

于 2021-03-11 11:30:31 发布

阅读量80

点赞数

分类专栏： java刷题文章标签：动态规划

本文链接：https://blog.csdn.net/Lily8888888/article/details/114657548

版权

java刷题专栏收录该内容

120 篇文章 0 订阅

订阅专栏

最小路径和

class Solution {
    public int minPathSum(int[][] grid) {
        int[][] f = new int[grid.length][grid[0].length];
        for (int i = 0; i < grid.length; i ++) {
            for (int j = 0; j < grid[0].length; j ++) {
                if (i == 0 && j == 0) f[i][j] = grid[i][j];
                else if (i == 0) f[i][j] = f[i][j - 1] + grid[i][j];
                else if (j == 0) f[i][j] = f[i - 1][j] + grid[i][j];
                else f[i][j] = Math.min(f[i - 1][j], f[i][j - 1]) + grid[i][j];
            }
        }
        return f[grid.length - 1][grid[0].length - 1];
    }
}