63

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& g) {
        int rows = g.size(), cols = g[0].size();
        int dp[rows+1][cols+1];
        memset(dp, 0, sizeof dp);
        if(!g[0][0])
            dp[1][1] = 1;
        for(int i=1; i<=rows; i++){
            for(int j=1; j<=cols; j++){
                if(g[i-1][j-1] == 1) continue;
                dp[i][j] += dp[i-1][j];
                dp[i][j] += dp[i][j-1];
            }
        }
        return dp[rows][cols];
    }
};