Leetcode#63. 不同路径 II

解题思路：

• 动态规划

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) 
    {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
        int res[m][n];
        for(int i = 0; i < m; ++i)
        {
            for(int j = 0; j < n; ++j)
            {
                if(obstacleGrid[i][j] == 1)
                    res[i][j] = 0;
                else if(i == 0 && j == 0)
                    res[0][0] = 1; 
                else if(i == 0)
                    res[i][j] = res[i][j - 1];
                else if(j == 0)
                    res[i][j] = res[i - 1][j];
                else
                    res[i][j] = res[i - 1][j] + res[i][j - 1];
            }
        }
        return res[m - 1][n - 1];
    }
};