LeetCode-Minimum Path Sum

作者：disappearedgod
文章出处：/article/3730229.html
时间：2014-9-15

题目

Minimum Path Sum

Total Accepted: 17168 Total
Submissions: 54951My 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];

}
}

结果

My Submissions for Minimum Path Sum

Submit Time	Status	Run Time	Language
1 minute ago	Accepted	380 ms	java

返回

LeetCode
Solution(持续更新，java>c++)