# LeetCode Unique Paths II

173人阅读 评论(0)

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.

public static int uniquePathsWithObstacles(int[][] obstacleGrid)
{
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
int[][] nums = new int[m][n];
if(obstacleGrid[0][0] == 1)
return 0;
nums[0][0] = 1;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(i == 0 && j > 0)
{
if(obstacleGrid[i][j] == 0 && obstacleGrid[i][j - 1] != 1 && nums[i][j-1] != 0)
nums[i][j] = 1;
else if(obstacleGrid[i][j] == 0 && obstacleGrid[i][j - 1] == 1)
nums[i][j] = 0;
else if(obstacleGrid[i][j] == 1)
nums[i][j] = 0;
}
if(i > 0 && j == 0)
{
if(obstacleGrid[i][j] == 0 && obstacleGrid[i-1][j] != 1 && nums[i-1][j] != 0)
nums[i][j] = 1;
else if(obstacleGrid[i][j] == 0 && obstacleGrid[i-1][j] == 1)
nums[i][j] = 0;
else if(obstacleGrid[i][j] == 1)
nums[i][j] = 0;
}
if(i > 0 && j > 0)
{
if(obstacleGrid[i][j] == 1)
nums[i][j] = 0;
else if(obstacleGrid[i][j] != 1)
nums[i][j] = nums[i-1][j] + nums[i][j-1];
}
}
}
return nums[m-1][n-1];
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：175155次
• 积分：4214
• 等级：
• 排名：第8400名
• 原创：243篇
• 转载：108篇
• 译文：0篇
• 评论：28条
评论排行
最新评论