leetcode 64 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.

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

这是一道标准的dynamic programming题，该题和62题唯一路径很像，第一想法是根据62题的思路，把所有的路径都求出来，然后取出路径最小值，但直觉告诉我不应该是这样。参考其他大神的思想，主要递推公式是到达第i,j位置时其路径长为i,j处元素的值+min{(i-1, j), (i, j-1)}处的路径长，但需要考虑i = 0 和j = 0特殊行、列的计算，最终代码如下：

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