063.cpp

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size(), n =obstacleGrid[0].size();
        vector<vector<int> > dp(m, vector<int>(n, 0));
        dp[0][0] = 1;
        for(int i=0; i<m ;i++)
        {
            for(int j=0; j<n; j++)
            {
                // 障碍点设置为0
                if(obstacleGrid[i][j] == 1) 
                {
                    dp[i][j] = 0;
                    continue;
                }
                if(i==0 && j==0) dp[0][0];
                else if(i==0) dp[i][j] = dp[i][j-1];
                else if(j==0) dp[i][j] = dp[i-1][j];
                else dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
};