64. Minimum Path Sum

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.

Subscribe to see which companies asked this question.

Solution:

Tips:

easy dp, dp[i][j] = Math.min(dp[i][j] + dp[i - 1][j], dp[i][j] + dp[i][j - 1]);

Java Code:

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