leetcode64. 最小路径和

class Solution {
    public int minPathSum(int[][] grid) {
        //f[i][j]用来表示到达(i,j)位置时最小的路径总和
        int m = grid.length,n = grid[0].length;
        int[][] f= new int[m][n];
        f[0][0] = grid[0][0];
        for(int i = 1;i < m;i++)
            f[i][0] = f[i-1][0] + grid[i][0];
        for(int j = 1;j < n;j++)
            f[0][j] = f[0][j-1] + grid[0][j];

        for(int i = 1;i < m;i++)
            for(int j = 1;j < n;j++){
                f[i][j] = Math.min(f[i][j-1],f[i-1][j]) + grid[i][j];    
            }
                
        return f[m-1][n-1];
    }
}