LeetCode 63. Unique Paths II（唯一路径）

最新推荐文章于 2024-07-25 09:04:50 发布

jmspan

最新推荐文章于 2024-07-25 09:04:50 发布

阅读量324

点赞数

分类专栏：动态规划唯一路径路线文章标签： leetcode

本文链接：https://blog.csdn.net/jmspan/article/details/51468912

版权

动态规划同时被 3 个专栏收录

63 篇文章 0 订阅

订阅专栏

路径

17 篇文章 0 订阅

订阅专栏

路线

8 篇文章 0 订阅

订阅专栏

原题网址：https://leetcode.com/problems/unique-paths-ii/

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.

Note: m and n will be at most 100.

方法：动态规划。

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int[] paths = new int[obstacleGrid[0].length];
        for(int i=0; i<obstacleGrid.length; i++) {
            int[] prev = paths;
            paths = new int[obstacleGrid[0].length];
            for(int j=0; j<obstacleGrid[i].length; j++) {
                paths[j] = 0;
                if (obstacleGrid[i][j] == 1) continue;
                if (i==0 && j==0) paths[j] = 1;
                else if (i==0 && paths[j-1] == 1) paths[j] = 1;
                else if (j==0 && prev[j] == 1) paths[j] = 1;
                else if (i!=0 && j!=0) paths[j] = paths[j-1] + prev[j];
            }
        }
        return paths[paths.length-1];
    }
}