存在障碍的点到点路径和问题（动态规划）

63. Unique Paths II
原地解法：

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

使用辅助容器（从solution里看到的）：

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