63. Unique Paths II

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.

Subscribe to see which companies asked this question.

找出从矩阵的左上角到右上角有多少条路，其中1代表阻碍。用动态规划的方法。到当前位置的走法有两种，分别是从上面下来和从左边过来，所以把两边的路数相加就得到到当前位置的路数。

代码：

class Solution
{
public:
	int uniquePathsWithObstacles(vector<vector<int> >& obstacleGrid) 
	{
		if(obstacleGrid.empty()) return 0;
		int m = obstacleGrid.size(), n = obstacleGrid[0].size();
		vector<vector<int> >dp(m, vector<int>(n, 1));
		if(obstacleGrid[0][0]) dp[0][0] = 0;
		for(int i = 0; i < m; ++i)
		{
			for(int j = 0; j < n; ++j)
			{
				if(i == 0 && j == 0) continue;
				if(obstacleGrid[i][j] == 1)
				{
					dp[i][j] = 0;
					continue;
				}
				int left = (j ==0 || dp[i][j-1] == 0) ? 0 : dp[i][j-1];
				int up = (i == 0 || dp[i-1][j] == 0) ? 0 : dp[i-1][j];
				dp[i][j] = left + up;
			}
		}
		return dp[m-1][n-1];
	}
};