LeetCode Hot 100 No.64 最小路径和

思路：
状态转移方程：min[i] [j] = grid[ i ] [ j ] + min(min[ i-1 ] [ j ], min[ i ] [ j-1 ])

class Solution {
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(i==0&&j==0)
                    grid[i][j] = grid[i][j];
                if(i==0&&j!=0)
                {
                    grid[i][j] += grid[i][j-1];
                }
                if(i!=0&&j==0)
                {
                    grid[i][j] += grid[i-1][j];
                }
                if(i!=0&&j!=0)
                {
                    grid[i][j] += Math.min(grid[i-1][j],grid[i][j-1]);
                }
            }
        }
        return grid[m-1][n-1];

    }
}