LC64_MinimumPathSum.java

package practise.leetCode;

public class LC64_MinimumPathSum {
    public static void main(String[] args) {
        int [][] grid = {{1,3,1},{1,5,1},{4,2,1}};
        System.out.println(minPathSum(grid));
    }
    public static Integer minPathSum(int[][] grid) {
        int rows = grid.length;
        int cols = grid[0].length;

        int[][] dp = new int[rows][cols];

        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                dp[i][j] =  grid[i][j];
            }
        }

        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (i > 0 && j > 0) {
                    int min = Math.min(dp[i-1][j], dp[i][j-1]);
                    dp[i][j] = min + dp[i][j];
                } else if (i > 0) {
                    dp[i][j] = dp[i-1][j] + dp[i][j];
                } else if (j > 0) {
                    dp[i][j] = dp[i][j-1] + dp[i][j];
                }
            }
        }

        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                System.out.print(dp[i][j] + " ");
            }
            System.out.println();
        }
        return dp[rows - 1][cols - 1];
    }
}