LeetCode-Minimum Path Sum

题目：https://oj.leetcode.com/problems/minimum-path-sum/

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

分析：

设状态为f[i][j]，表示从起点(0,0) 到达(i, j) 的最小路径和，则状态转移方程为：f[i][j]=min(f[i-1][j], f[i][j-1])+grid[i][j]

源码：Java版本
算法分析：二维动态规划。时间复杂度O(m*n)，空间复杂度O(m*n)

public class Solution {
    public int minPathSum(int[][] grid) {
        int m=grid.length;
        int 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-1][j],f[i][j-1])+grid[i][j];
            }
        }
        return f[m-1][n-1];
    }
}