110 · 最小路径和Minimum Path Sum
描述
Given a m * nm∗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.
Example 1:
Input:
grid = [[1,3,1],[1,5,1],[4,2,1]]
Output:
7
Explanation:
Path is: 1 -> 3 -> 1 -> 1 -> 1
public class Solution {
/**
* @param grid: a list of lists of integers
* @return: An integer, minimizes the sum of all numbers along its path
*/
public int minPathSum(int[][] grid) {
// write your code here
int m = grid.length , n = grid[0].length ;
int[][] f = new int[m][n] ;
f[0][0] = grid[0][0] ;
for(int i = 1 ; i < m ; i++){
f[i][0] = f[i-1][0] + grid[i][0] ;
}
for(int i = 1 ; i < n ; i++){
f[0][i] = f[0][i-1] + grid[0][i] ;
}
for(int i = 1 ; i < m ; i++){
for(int j = 1 ; j < n ; j++){
f[i][j] = Math.min(f[i-1][j] , f[i][j-1]) + grid[i][j] ;
}
}
return f[m-1][n-1] ;
}
}