LeetCode OJ 第63题Unique Paths ||

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.

Note: m and n will be at most 100.

此题我们利用DP算法来提高算法的执行时间，代码如下：

int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
	bool xhas1 = false;
	bool yhas1 = false;
	int m = obstacleGrid.size();
	int n = obstacleGrid[0].size();
	if (!m || obstacleGrid[0][0] == 1){   //如果首元素为1，则没有路径
		return 0;
	}
	else{
		obstacleGrid[0][0] = 1;
	}
	//更新第一列
	for (int i = 1; i < m; i++){
		if (yhas1) obstacleGrid[i][0] = 0;
		else if(obstacleGrid[i][0]==1){
			yhas1 = true;
			obstacleGrid[i][0] = 0;
		}
		else{
			obstacleGrid[i][0] = 1;
		}
	}
	//更新第二列
	for (int i = 1; i < n;i++)
	{
		if (xhas1) obstacleGrid[0][i] = 0;
		else if (obstacleGrid[0][i] == 1){
			obstacleGrid[0][i] = 0;
			xhas1 = true;
		}
		else{
			obstacleGrid[0][i] = 1;
		}
	}
	for (int i = 1; i < m; i++){
		for (int j = 1; j < n; j++){
			if (obstacleGrid[i][j] == 1){
				obstacleGrid[i][j] = 0;
			}
			else{
				obstacleGrid[i][j] = obstacleGrid[i][j - 1] + obstacleGrid[i - 1][j];
			}
		}
	}
	return obstacleGrid[m - 1][n - 1];
}