63. Unique Paths II

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