问题描述
笔记
要加入障碍的判断。
初始化第一行和第一列的时候,如果遇到障碍,往后的buff都是0。
状态转移方程加入当前节点obstacleGrid[i][j]
的判断,如果obstacleGrid[i][j] == 1
则buff[i][j] = 0
代码
class Solution {
public:
/**
* @param obstacleGrid: A list of lists of integers
* @return: An integer
*/
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
// write your code here
const int m = obstacleGrid.size();
const int n = obstacleGrid[0].size();
vector<vector<int>> buff(m, vector<int>(n, 0));
for (int i = 0; i < m; i++)
{
if (obstacleGrid[i][0])
{
for (int k = i; k < m; k++)
{
buff[k][0] = 0;
}
break;
}
else
buff[i][0] = 1;
}
for (int j = 0; j < n; j++)
{
if (obstacleGrid[0][j])
{
for (int k = j; k < n; k++)
{
buff[0][j] = 0;
}
break;
}
else
buff[0][j] = 1;
}
for (int i = 1; i < m; i++)
{
for (int j = 1; j < n; j++)
{
if (obstacleGrid[i][j])
{
buff[i][j] = 0;
}
else
{
buff[i][j] = buff[i-1][j] + buff[i][j-1];
}
}
}
return buff[m-1][n-1];
}
};