Middle-题目61：63. Unique Paths II

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.

Middle-题目21中，再增加一个障碍矩阵，有障碍的点是不能走的，仍然求不同的路径个数。

public class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
dp[0][0] = obstacleGrid[0][0]==0?1:0;
for(int i=1;i<m;i++)
if(obstacleGrid[i][0] == 0)
dp[i][0]=dp[i-1][0];
for(int i=1;i<n;i++)
if(obstacleGrid[0][i] == 0)
dp[0][i]=dp[0][i-1];
for(int i=1;i<m;i++)
for(int j=1;j<n;j++)
if(obstacleGrid[i][j] == 0)
dp[i][j] = dp[i-1][j] + dp[i][j-1];
return dp[m-1][n-1];
}
}

1ms,beats 17.74%,众数1ms,82.26%

LeetCode 63 — Unique Paths II（C++ Java Python）

2014-02-25 22:19:29

63 Unique Paths II

2015-10-17 15:31:45

Leetcode 63:Unique Paths II

2016-02-24 00:15:36

leetcode 63. Unique Paths II-唯一路径|动态规划

2016-03-11 20:53:57

LeetCode63:Unique Paths II

2015-06-12 16:05:00

[LeetCode][Java] Unique Paths II

2015-07-17 09:59:08

leetCode 62.Unique Paths （唯一路径） 解题思路和方法

2015-07-15 14:23:47

LeetCode 63. Unique Paths II--Python实现

2018-01-16 15:01:22

[LeetCode63]Unique pathII动态规划解题示例

2017-05-07 18:24:37

leetcode 62. Unique Paths-唯一路径|动态规划

2016-03-11 15:16:22