首页 > 代码库 > 【leetcode】 Unique Path ||(easy)
【leetcode】 Unique Path ||(easy)
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.
思路：跟Unique Paths差不多，就是把有障碍的地方方法数变成0，注意左上角为障碍的情况
class Solution {public: int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) { if(obstacleGrid.empty()) { return 0; } vector<vector<int>> ways(obstacleGrid.size(), vector<int>(obstacleGrid[0].size(),1)); if(obstacleGrid[0][0] == 1) { ways[0][0] = 0; } for(int c = 1; c < obstacleGrid[0].size(); c++) { ways[0][c] = (obstacleGrid[0][c] == 1) ? 0 : ways[0][c - 1]; } for(int r = 1; r < obstacleGrid.size(); r++) { ways[r][0] = (obstacleGrid[r][0] == 1) ? 0 : ways[r - 1][0]; } for(int i = 1; i < obstacleGrid.size(); i++) { for(int j = 1; j < obstacleGrid[0].size(); j++) { ways[i][j] = (obstacleGrid[i][j] == 1) ? 0 : ways[i - 1][j] + ways[i][j - 1]; } } return ways[obstacleGrid.size() - 1][obstacleGrid[0].size() - 1]; }};
【leetcode】 Unique Path ||(easy)
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。