样例
[
[0,0,0],
[0,1,0],
[0,0,0]
]
因为只能向下和向右走,
class Solution {
public:
/*
* @param obstacleGrid: A list of lists of integers
* @return: An integer
*/
int uniquePathsWithObstacles(vector<vector<int>> &A) {
// write your code here
vector<vector<int>> dp;
int m = A.size();
int n = A[0].size();
dp.resize(A.size()+1);
for (int i = 0; i < m+1; i++
{
dp[i].resize(n+1);
dp[i][n] = 0;
}
for (int i = 0; i < n+1; i++)
dp[m][i] = 0;
for (int i = m-1; i >= 0; i--)
for (int j = n-1; j >= 0; j--)
{
if (A[i][j] == 1)
dp[i][j] = 0;
else if (i == m-1 && j == n-1) dp[i][j] = 1;
else dp[i][j] = dp[i+1][j] + dp[i][j+1];
}
return dp[0][0];
}
};