Leetcode 64. Minimum Path Sum (Medium) (java)

Leetcode 64. Minimum Path Sum (Medium) (java)

Tag: Array, Dynamic Programming

Difficulty: Medium

/*

64. Minimum Path Sum (Medium)

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) {
        if (grid == null || grid.length == 0) {
            return 0;
        }
        int m = grid.length, n = grid[0].length;
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = Integer.MAX_VALUE;
        }
        res[0] = 0;
        for (int i = 0; i < m; i++) {
            res[0] += grid[i][0];
            for (int j = 1; j < n; j++) {
                res[j] = Math.min(res[j], res[j-1]) + grid[i][j];
            }
        }
        return res[n - 1];
    }
}