63. Unique Paths II**
2016-12-06 21:52
211 查看
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
in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
The total number of unique paths is
Reference
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int width = obstacleGrid[0].length;
int[] dp = new int[width];
dp[0] = 1;
for (int[] row : obstacleGrid) {
for (int j = 0; j < width; j++) {
if (row[j] == 1)
dp[j] = 0;
else if (j > 0)
dp[j] += dp[j - 1];
}
}
return dp[width - 1];
}
总结:没想出来, 绕晕了。思路大概是对的,具体细节还需考虑
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
1and
0respectively
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.
Reference
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int width = obstacleGrid[0].length;
int[] dp = new int[width];
dp[0] = 1;
for (int[] row : obstacleGrid) {
for (int j = 0; j < width; j++) {
if (row[j] == 1)
dp[j] = 0;
else if (j > 0)
dp[j] += dp[j - 1];
}
}
return dp[width - 1];
}
总结:没想出来, 绕晕了。思路大概是对的,具体细节还需考虑
相关文章推荐
- 63. Unique Paths II
- 63. Unique Paths II
- [leedcode 63] Unique Paths II
- LeetCode-62. Unique Paths/63. Unique Paths II
- 63. Unique Paths II
- 63. Unique Paths II
- Leet Code 63 Unique Paths II - 不同路径 - Java
- [leetcode 63] Unique Paths II
- 63. Unique Paths II
- 63 Unique Paths II
- leetcode[63]Unique Paths II
- LeetCode 63 Unique Paths II
- (java)leetcode-63:Unique Paths II
- 63. Unique Paths II
- 62. Unique Paths && 63 Unique Paths II
- 63. Unique Paths II
- Leetcode:63. Unique Paths II
- 63. Unique Paths II
- 【LeetCode】(63)Unique Paths II(Medium)
- 63. Unique Paths II