原题连接:leetcode63:不同路径II
先贴出题解的正确通过的代码:
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
if (obstacleGrid == null || obstacleGrid.length == 0) {
return 0;
}
int m = obstacleGrid.length, n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
for (int i = 0; i < m&&obstacleGrid[i][0] == 0; i++) {
dp[i][0] = 1;
}
for (int j = 0; j < n&&obstacleGrid[0][j] == 0; j++) {
dp[0][j] = 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];
}
第二个是我自己写的,只有一个地方不同,那就是前两个循环中题解是在for循环语句这一行中做了判断,而我是另外用if语句做了判断
两个代码的运行结果却不一致,没搞明白是为什么?
public int uniquePathsWithObstacles(int[][] obstacleGrid){
if (obstacleGrid == null || obstacleGrid.length == 0) {
return 0;
}
int m=obstacleGrid.length,n=obstacleGrid[0].length;
int[][] dp = new int[m][n];
for (int i = 0; i < m; i++) {
if(obstacleGrid[i][0]==0)
dp[i][0] = 1;
}
for (int i = 0; i < n; i++) {
if(obstacleGrid[0][i]==0)
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];
}
结果不一致的输入样例如下:
{{0,0},{1,1},{0,0}}
正确答案是0,而第二个代码运行结果为1 ,没想明白是什么原因