思路:
这道题与LeetCode62题几乎完全相同,只是在62题的基础上增加了“障碍”限制。因为只能向右和向下移动,那么容易想到,如果某一处[i,j]有障碍,那么它右侧的[i,j+1]位置只能经过[i-1,j+1]到达。因此[i,j+1]的值用[i-1,j+1]代替即可。如果一个位置[i,j]的上边和左边都是障碍的话,那么这个位置肯定不会被任何一个路径经过,因此可以认为是"隐形"障碍(第一行和第一列特殊对待)。问题中用1表示障碍,但是1与路径数1冲突,所以先将所有的1用-1代替。 然后先处理第一行和第一列的障碍、“隐形”障碍、非障碍。然后再循环处理非第一行或第一列的所有的障碍和“隐形”障碍以及非障碍。障碍和“隐形”障碍用-1填充,非障碍用路径数填充。
解法一
在原数组上直接操作
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int row = obstacleGrid.length;
int col = obstacleGrid[0].length;
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
if(obstacleGrid[i][j] == 1){
obstacleGrid[i][j] = -1;
}
}
}
boolean flag = true;
for(int i=0;i<col;i++){
if(obstacleGrid[0][i] == -1){
flag = false;
}
if(flag == true){
obstacleGrid[0][i] = 1;
}else{
obstacleGrid[0][i] = -1;
}
}
boolean flag1 = true;
for(int i=0;i<row;i++){
if(obstacleGrid[i][0] == -1){
flag1 = false;;
}
if(flag1 == true){
obstacleGrid[i][0] = 1;
}else{
obstacleGrid[i][0] = -1;
}
}
for(int i=1;i<row;i++){
for(int j=1;j<col;j++){
if(obstacleGrid[i][j] == -1){
continue;
}
if(obstacleGrid[i-1][j] != -1 && obstacleGrid[i][j-1] != -1){
obstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1];
}else if(obstacleGrid[i-1][j] == -1 && obstacleGrid[i][j-1] != -1){
obstacleGrid[i][j] = obstacleGrid[i][j-1];
}else if(obstacleGrid[i-1][j] != -1 && obstacleGrid[i][j-1] == -1){
obstacleGrid[i][j] = obstacleGrid[i-1][j];
}else{
obstacleGrid[i][j] = -1;
}
}
}
return obstacleGrid[row-1][col-1]==-1?0:obstacleGrid[row-1][col-1];
}
解法二
另外创建一个m*n的数组,与解法一相比,时间复杂度降低了,但是空间复杂度增加了。
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int n = obstacleGrid.length;
int m = obstacleGrid[0].length;
int[][] memo = new int[n][m];
for (int i = 0; i < m; i++) {
if (obstacleGrid[0][i] == 1) {
break;
}
memo[0][i] = 1;
}
for (int i = 0; i < n; i++) {
if (obstacleGrid[i][0] == 1) {
break;
}
memo[i][0] = 1;
}
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
if (obstacleGrid[i][j] == 0) {
memo[i][j] = memo[i - 1][j] + memo[i][j - 1];
}
}
}
return memo[n - 1][m - 1];
}