[leetcode]Unique Paths II

>这道题目和上一题基本是一样的。只需要检测现在正在处理的那个单位是不是不可通过的，如果是就直接让这个单元格=0，也就是没有路径可以到右下角就好了。

代码如下：

public class Solution {public int uniquePathsWithObstacles(int[][] obstacleGrid) {int  m=obstacleGrid.length;int  n=obstacleGrid[0].length;int[][] a=new int[m][n];if(obstacleGrid[m-1][n-1]==0)a[m-1][n-1]=1;elsea[m-1][n-1]=0;//a[m-2][n-1]=1;//a[m-1][n-2]=1;for(int row=m-1;row>=0;row--){for(int col=n-1;col>=0;col--){if((row==m-1&&col==n-1) || obstacleGrid[row][col]==1)continue;if(row==m-1){a[row][col]=a[row][col+1];}else if(col==n-1)a[row][col]=a[row+1][col];else    a[row][col]=a[row][col+1]+a[row+1][col];   }}return a[0][0];}
}

[leetcode]Unique Paths II相关推荐

[Lintcode]115. Unique Paths II/[Leetcode]63. Unique Paths II
115. Unique Paths II/63. Unique Paths II 本题难度: Easy/Medium Topic: Dynamic Programming Description Fo ...
【动态规划】LeetCode 63. Unique Paths II
LeetCode 63. Unique Paths II Solution1:我的答案在哪里做过这题? class Solution { public:int uniquePathsWithObst ...
LeetCode Unique Paths
原题链接在这里:https://leetcode.com/problems/unique-paths/ 题目: A robot is located at the top-left corner of ...
63. Unique Paths II and 64. Minimum Path Sum
文章目录 1 63 Unique Paths II 1.1 题目描述 1.2 动态规划解决 2 64. Minimum Path Sum 2.1 题目理解 2.2 动态规划这一遍刷dp的题目就很轻松 ...
LeetCode | Unique Paths I,II
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The ...
Unique Paths II leetcode java
题目: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. H ...
[LeetCode]--63. Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How m ...
[LeetCode][Java] Unique Paths II
题目: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. H ...
C#LeetCode刷题之#63-不同路径 II（Unique Paths II）
目录问题示例分析问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3682 访问. 一个机器人位于一个 m x ...

[leetcode]Unique Paths II

[leetcode]Unique Paths II相关推荐

最新文章

热门文章