leetcode--demo64最小路径和

leetcode–demo64最小路径和

这条题就是简单的dp

代码如下：

public class Main {
    
    
    public static void main(String[] args) {
    
    
        int[][] grid={
    
    {
    
    1,3,1},{
    
    1,5,1},{
    
    4,2,1}};
        System.out.println(new Solution().minPathSum(grid));
    }
}
class Solution{
    
    
    public int minPathSum(int[][] grid) {
    
    
        int n=grid.length;
        int m=grid[0].length;
        //将grid[][]重新赋值变成dp[][]
        for (int i=0;i<n;i++){
    
    
            for (int j=0;j<m;j++){
    
    
                if (i==0&&j==0)continue;
                else if (i==0){
    
    
                    grid[i][j]=grid[i][j-1]+grid[i][j];
                }else if (j==0){
    
    
                    grid[i][j]=grid[i-1][j]+grid[i][j];
                }else {
    
    
                    grid[i][j]=Math.min(grid[i][j-1],grid[i-1][j])+grid[i][j];
                }
            }
        }
        return grid[n-1][m-1];
    }
}