63. Unique Paths II

最新推荐文章于 2020-05-16 11:44:22 发布

15wylu

最新推荐文章于 2020-05-16 11:44:22 发布

阅读量113

点赞数 2

分类专栏： Leetcode LeetCode 文章标签： LeetCode Unique Paths II Dynamic Programming

本文链接：https://blog.csdn.net/qq_32767041/article/details/85930501

版权

Leetcode 同时被 2 个专栏收录

53 篇文章 0 订阅

订阅专栏

LeetCode

37 篇文章 1 订阅

订阅专栏

Description

https://leetcode.com/problems/unique-paths-ii/

Solving Ideas

https://leetcode.com/problems/unique-paths-ii/solution/

动态规划：

State:
dp[i][j]: 从grid[0][0]到grid[i][j]的路径数

Initial State:

dp[0][0] = 1
dp[i][0] = obstacleGrid[i][0] == 1 ? 0 : dp[i - 1][0] (i > 0)
dp[0][j] = obstacleGrid[0][j] == 1 ? 0 : dp[0][j - 1] (j > 0)

State Transition:

dp[i][j] = obstacleGrid[i][j] == 1 ? 0 : dp[i - 1][j] + dp[i][j - 1] (i > 0 && j > 0)

时间复杂度： $O (m * n)$
空间复杂度： $O (m * n)$

Solution

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if (obstacleGrid == null || obstacleGrid.length == 0
                || obstacleGrid[0].length == 0) return -1;

        if (obstacleGrid[0][0] == 1) return 0;
        
        int m = obstacleGrid.length, n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = 1;
        
        for (int i = 1; i < m; i++) dp[i][0] = obstacleGrid[i][0] == 1 ? 0 : dp[i - 1][0];
        for (int j = 1; j < n; j++) dp[0][j] = obstacleGrid[0][j] == 1 ? 0 : dp[0][j - 1];
        
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = obstacleGrid[i][j] == 1 ? 0 : dp[i - 1][j] + dp[i][j - 1];
            }
        }
        
        return dp[m - 1][n - 1];
    }
}