[leetcode]63. Unique Paths II(有障碍物求路径和)

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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.

Note: m and n will be at most 100.

Example 1:

Input:
[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]
Output: 2
Explanation:
There is one obstacle in the middle of the 3x3 grid above.
There are two ways to reach the bottom-right corner:
1. Right -> Right -> Down -> Down
2. Down -> Down -> Right -> Right

 

题意

 

思路： 记忆化搜索(dfs + memo)

 

代码

 1 public class _63_UniquePathsII {
 2     private int[][] memo;  // 缓存
 3     public int uniquePathsWithObstacles(int[][] obstacleGrid) {
 4         final int m = obstacleGrid.length;
 5         final int n = obstacleGrid[0].length;
 6         if (obstacleGrid[0][0] != 0 ||
 7                 obstacleGrid[m - 1][n - 1] != 0) return 0;
 8 
 9         memo = new int[m][n];
10         memo[0][0] = obstacleGrid[0][0] != 0 ? 0 : 1;
11         return dfs(obstacleGrid, m - 1, n - 1);
12     }
13 
14     // @return 从 (0, 0) 到 (x, y) 的路径总数
15     int dfs(int[][] obstacleGrid, int x, int y) {
16         if (x < 0 || y < 0) return 0; // 数据非法，终止条件
17 
18         // (x,y)是障碍
19         if (obstacleGrid[x][y] != 0) return 0;
20 
21         if (x == 0 && y == 0) return memo[0][0]; // 回到起点，收敛条件
22 
23         if (memo[x][y] > 0) {
24             return memo[x][y];
25         } else {
26             return memo[x][y] = dfs(obstacleGrid, x - 1, y) +
27                     dfs(obstacleGrid, x, y - 1);
28         }
29     }
30 }

 

转载于:https://www.cnblogs.com/liuliu5151/p/10953066.html