Minimum Path Sum

public class Solution {
    public int minPathSum(int[][] grid) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int m = grid.length;
        int n = grid[0].length;
        int[][] result = new int[m][n];
        for(int i = 0; i < m; i++)
            for(int j = 0; j < n; j++){
                if(i - 1 < 0 && j - 1 < 0)
                    result[0][0] = grid[0][0];
                else if(i - 1 < 0)
                    result[i][j] = result[i][j-1] + grid[i][j];
                else if(j - 1 < 0)
                    result[i][j] = result[i-1][j] + grid[i][j];
                else
                    result[i][j] = Math.min(result[i-1][j], result[i][j-1]) + grid[i][j];
            }
        
        return result[m-1][n-1];
    }
}