32.Unique Paths II.cpp

// Problem Description: https://leetcode.com/problems/unique-paths-ii/

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

    }
};