# [Leetcode]Unique Path II

Unique Paths II My Submissions Question
Total Accepted: 51318 Total Submissions: 180828 Difficulty: Medium

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.

Subscribe to see which companies asked this question

class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& g) {
int m = g.size();
if(!m)  return 0;
int n = g[0].size();
vector<vector<int> > dp(m,vector<int>(n,0));
for(int i = 0;i != m;++i){
if(g[i][0] != 1)    dp[i][0] = 1;
else break;
}
for(int j = 0;j != n;++j){
if(g[0][j] != 1)    dp[0][j] = 1;
else break;
}
for(int i = 1;i != m;++i){
for(int j = 1;j != n;++j){
if(g[i][j] == 1){
dp[i][j] = 0;
continue;
}
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
};

P.S 空间复杂度或许可以利用滚动数组降低下？睡觉时候想一想，想出来了更新

#### [LeetCode63]Unique pathII动态规划解题示例

2017-05-07 18:24:37

#### LeetCode 63 — Unique Paths II（C++ Java Python）

2014-02-25 22:19:29

#### [LeetCode][Java] Unique Paths II

2015-07-17 09:59:08

#### LeetCode | Unique Binary Search Trees II

2013-12-23 14:58:40

#### 【LeetCode-面试算法经典-Java实现】【063-Unique Paths II（唯一路径问题II）】

2015-08-01 07:19:35

#### leetcode 62. Unique Paths-唯一路径|动态规划

2016-03-11 15:16:22

#### LeetCode63:Unique Paths II

2015-06-12 16:05:00

#### LeetCode(95)Unique Binary Search Trees II

2014-01-13 05:20:18

#### Unique Binary Search Trees -- LeetCode

2014-04-30 06:16:29

#### leetcode-java-95. Unique Binary Search Trees II

2016-08-15 15:52:30