题目原文:
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.
题目大意:
在Middle-题目21中,再增加一个障碍矩阵,有障碍的点是不能走的,仍然求不同的路径个数。
题目分析:
改动不大,有路障的点路径个数置0即可。需要注意一些特殊情况:如果起点有路障,则整个矩阵都是0;如果第一行(列)有路障,则路障点的右边(下边)都是0.。
源码:(language:java)
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%