class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int m = obstacleGrid.size();
if (m == 0) return 0;
int n = obstacleGrid[0].size();
if (n == 0) return 0;
vector<vector<int> > dp(m, vector<int>(n));
dp[0][0] = 1 - obstacleGrid[0][0];
for (int i = 1; i < m; i++)
dp[i][0] = obstacleGrid[i][0] ? 0 : dp[i - 1][0];
for (int j = 1; j < n; j++)
dp[0][j] = obstacleGrid[0][j] ? 0 : dp[0][j - 1];
for (int i = 1; i < m; i++)
for (int j = 1; j < n; j++)
dp[i][j] = obstacleGrid[i][j] ? 0 : dp[i - 1][j] + dp[i][j - 1];
return dp[m - 1][n - 1];
}
};
Small Case: 4ms
Large Case: 16ms
Time: O(n^2)
Space: O(n^2)