LeetCode 64 Minimum Path Sum (数字三角形)

最新推荐文章于 2024-09-18 10:31:28 发布

_TCgogogo_

最新推荐文章于 2024-09-18 10:31:28 发布

阅读量828

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签： leetcode dp

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/52356257

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

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.

题目链接：https://leetcode.com/problems/minimum-path-sum/

题目分析：基础的动态规划问题，dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + grid[i][j]

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