LeetCode题目:Minimum Path Sum

原题地址：https://leetcode.com/problems/minimum-path-sum/

大意：给出一个二维数组(int类型)，求出从左上角到右下角最短的路径。

解决方法：动态规划

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        if(!m)
            return ;
        int n = grid[].size();

        vector<vector<int>> coll(m, vector<int>(n, ));
        coll[][] = grid[][];
        for(int i = ; i < m; ++i)
            coll[i][] = grid[i][] + coll[i - ][];
        for(int i = ; i < n; ++i)
            coll[][i] = grid[][i] + coll[][i - ];

        for(int i = ; i < m; ++i)
            for(int j = ; j < n; ++j)
                coll[i][j] = min(coll[i - ][j], coll[i][j - ]) + grid[i][j];

        return coll[m - ][n - ];
    }
};