Unique Paths II

最新推荐文章于 2024-04-01 00:43:20 发布

CSLDBLYDX

最新推荐文章于 2024-04-01 00:43:20 发布

阅读量254

点赞数

分类专栏： DP leetCode

本文链接：https://blog.csdn.net/CSLDBLYDX/article/details/42490623

版权

leetCode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

29 篇文章 0 订阅

订阅专栏

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]
]

这里要注意右下角为1时返回值应该是0；

memset 可以设置 0， -1

class Solution {
public:
	static const int MAX = 100 + 3;
	int dp[MAX][MAX];
	int rows,cols;
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        if(obstacleGrid.size() == 0)return 0;
		if(obstacleGrid[0].size() == 0)return 0;
		memset(dp, -1, sizeof(dp));

		rows = obstacleGrid.size();
		cols = obstacleGrid[0].size();
		return path(1,1,obstacleGrid);
    }

	int path(int r,int c,vector<vector<int> > &grid)
	{
		if(grid[rows - 1][cols - 1])return 0;
		if(r == rows && c == cols)return 1;
		if(dp[r][c] != -1)return dp[r][c];
		int rst = 0;
		if(!grid[r - 1][c - 1] && r < rows)rst += path(r + 1, c, grid);
		if(!grid[r - 1][c - 1] && c < cols)rst += path(r, c + 1, grid);

		dp[r][c] = rst;
		return rst;
	}
};