LeetCode-Minimum Path Sum

最新推荐文章于 2024-06-04 23:33:59 发布

disappearedgod

最新推荐文章于 2024-06-04 23:33:59 发布

阅读量1k

点赞数

分类专栏： number LeetCode 文章标签： LeetCode number

本文链接：https://blog.csdn.net/disappearedgod/article/details/39296023

版权

LeetCode 同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

number

5 篇文章 0 订阅

订阅专栏

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/39296023

时间：2014-9-15

题目

Minimum Path Sum

Total Accepted: 17168 Total Submissions: 54951 My Submissions

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.

想法

代码

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