Leetcode-64- minimum path sum

subject

Ideas

1. A good look at pure good pure dynamic programming , It doesn't mean much.
2. dp[i][j] From arr[0][0] To arr[i][j] The smallest path of

Code

    public int minPathSum(int[][] grid) {
    
        int[][] dp = new int[grid.length][grid[0].length];
        dp[0][0]=grid[0][0];
        // Initial value of Fu 
        for(int i=1;i<grid.length;i++) dp[i][0]=dp[i-1][0]+grid[i][0];
        for(int i=1;i<grid[0].length;i++) dp[0][i]=dp[0][i-1]+grid[0][i];
        // Assignment per layer 
        for(int i=1;i<grid.length;i++){
    
            for (int j=1;j<grid[0].length;j++){
    
                dp[i][j] = grid[i][j]+Math.min(dp[i-1][j],dp[i][j-1]);
            }
        }
        return dp[grid.length-1][grid[0].length-1];
    }