63. Unique Paths II

和Unique paths是一样的

 1     public int uniquePathsWithObstacles(int[][] obstacleGrid) {
 2         if(obstacleGrid == null || obstacleGrid.length == 0 || obstacleGrid[0].length == 0) {
 3             return 0;
 4         }
 5         int len = obstacleGrid[0].length;
 6         int[] res = new int[len];
 7         res[0] = 1;
 8         for(int i = 0; i < obstacleGrid.length; i++) {
 9             for(int j = 0; j < len; j++) {
10                 if(obstacleGrid[i][j] == 1) {
11                     res[j] = 0;
12                 } else {
13                     if(j > 0) {
14                         res[j] += res[j-1];
15                     }
16                 }
17             }
18         }
19         return res[len-1];
20     }

注意的是：

1.内外循坏都要从0开始，因为第一行也可能不可以走，并不能像上一题一样初始化成1

2. 第13行需要检查一下j是不是第一个

没啦！

转载于:https://www.cnblogs.com/warmland/p/5260327.html

63. 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 ...
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 63. Unique Paths II
LeetCode 63. Unique Paths II Solution1:我的答案在哪里做过这题? class Solution { public:int uniquePathsWithObst ...
[LeetCode]--63. Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How m ...
LeetCode 63. Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How m ...
63. Unique Paths II 动态规划
description: https://leetcode.com/problems/unique-paths/ 机器人从一堆方格的左上角走到右下角,只能往右或者往下走 ,问有几种走法,这个加了难度, ...
63. Unique Paths II 不同路径 II
Title 一个机器人位于一个 m x n 网格的左上角 (起始点在下图中标记为"Start" ). 机器人每次只能向下或者向右移动一步.机器人试图达到网格的右下角(在下图中标记为 ...
leetcode63. Unique Paths II
题目要求 Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. H ...
Unique Paths II leetcode java
题目: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. H ...

63. Unique Paths II

63. Unique Paths II相关推荐

最新文章

热门文章