LeetCode#64 Minimum Path Sum

1、对于一个矩阵，可以按照向右或向下将其拆分。右下角的值取上或左中较小值即可。依次遍历即可。

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        if(n == 0)
            return 0;
        vector<vector<int>> result(m, vector<int>(n, 0));
        result[0][0] = grid[0][0];
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                if(!i && !j)
                    continue;
                if(i == 0){
                    result[i][j] = result[i][j-1] + grid[i][j];
                    continue;
                }
                if(j == 0){
                    result[i][j] = result[i-1][j] + grid[i][j];
                    continue;
                }
                result[i][j] = min(result[i][j-1], result[i-1][j]) + grid[i][j];
            }
        }
        
        return result[m-1][n-1];
    }
};