【LeetCode】Unique Paths II

class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid)
{
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();

vector<vector<int>> result(m,vector<int>(n));
int i, j;
result[0][0] = obstacleGrid[0][0] == 1 ? 0 : 1;
for (i = 1; i < m; i++)
{
result[i][0] = obstacleGrid[i][0] == 1 ? 0 : result[i - 1][0];
}
for (j = 1; j < n; j++)
{
result[0][j] = obstacleGrid[0][j] == 1 ? 0 : result[0][j - 1];
}
for (i = 1; i < m; i++)
{
for (j = 1; j < n; j++)
{
result[i][j] = obstacleGrid[i][j] == 1 ? 0 : result[i - 1][j] + result[i][j - 1];
}
}
return result[m - 1][n - 1];
}
};