63. Unique Paths II

最新推荐文章于 2020-07-06 10:19:42 发布

csdnzhaocsdn

最新推荐文章于 2020-07-06 10:19:42 发布

阅读量76

点赞数

分类专栏： LeetCode 动态规划、贪心

本文链接：https://blog.csdn.net/qq_39360744/article/details/104235149

版权

LeetCode 同时被 2 个专栏收录

109 篇文章 0 订阅

订阅专栏

动态规划、贪心

23 篇文章 0 订阅

订阅专栏

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:

Right -> Right -> Down -> Down
Down -> Down -> Right -> Right

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/unique-paths-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        if(m <= 0) return 0;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        for(int i=0; i<m; ++i){
            for(int j=0; j<n; ++j){
                if(obstacleGrid[i][j]==1){
                    dp[i][j] = 0;
                }else{
                    if(i==0 && j==0){	//若起始点有路障
                        dp[i][j] = 1;
                    }else if(i==0){
                        dp[i][j] = dp[i][j-1];
                    }else if(j==0){
                        dp[i][j] = dp[i-1][j];
                    }else{
                        dp[i][j] = dp[i-1][j] + dp[i][j-1];
                    }
                }
            }
        }
        return dp[m-1][n-1];
    }
}