题目:力扣
解题思路:
dfs:
一开始先用了dfs,但是超时了,原因是有大量重复遍历。
动态规划:
可以用dp[i][j]表示从起始位置(0,0)到(i,j)的路径数目,因为只能向下和向右走,所以dp[i][j]
=dp[i-1][j]+dp[i][j-1];
动态规划+滚动数组:
我们可以运用「滚动数组思想」把空间复杂度优化称 O(m)O(m)。「滚动数组思想」是一种常见的动态规划优化方法,在我们的题目中已经多次使用到,例如「剑指 Offer 46. 把数字翻译成字符串」、「70. 爬楼梯」等,当我们定义的状态在动态规划的转移方程中只和某几个状态相关的时候,就可以考虑这种优化方法,目的是给空间复杂度「降维」。
class Solution {
//dfs
int res = 0;
public int uniquePathsWithObstacles1(int[][] obstacleGrid) {
dfs(obstacleGrid,0,0);
return res;
}
public void dfs(int[][] obstacleGrid, int x, int y){
if(x < 0 || x >= obstacleGrid.length || y < 0 || y >= obstacleGrid[0].length){
return;
}
if(obstacleGrid[x][y] == 1){
return;
}
if(x == obstacleGrid.length-1 && y == obstacleGrid[0].length-1){
res += 1;
return;
}
dfs(obstacleGrid, x+1, y);
dfs(obstacleGrid, x, y+1);
}
//动态规划,普通
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int row = obstacleGrid.length;
int col = obstacleGrid[0].length;
int[][] dp = new int[row][col];
dp[0][0] = obstacleGrid[0][0] == 0? 1:0;
for(int i = 1; i < row; i++){
if(obstacleGrid[i][0] == 1)
dp[i][0] = 0;
else{
dp[i][0] = dp[i-1][0];
}
}
for(int i = 1; i < col; i++){
if(obstacleGrid[0][i] == 1)
dp[0][i] = 0;
else{
dp[0][i] = dp[0][i-1];
}
}
for(int i = 1; i < row ; i++){
for(int j = 1; j < col; j++){
if(obstacleGrid[i][j] == 1){
dp[i][j] = 0;
}
else{
dp[i][j] = dp[i-1][j]+dp[i][j-1];
}
}
}
return dp[row-1][col-1];
}
//动态规划,滑动数组
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int row = obstacleGrid.length;
int col = obstacleGrid[0].length;
int[] dp = new int[col];
dp[0] = obstacleGrid[0][0] == 0? 1:0;
for(int i = 0; i < row ; i++){
for(int j = 0; j < col; j++){
if(obstacleGrid[i][j] == 1){
dp[j] = 0;
}
else{
if(j >0)
dp[j] = dp[j]+dp[j-1];
}
}
}
return dp[col-1];
}
}