# [Leetcode]Unique Path II

145人阅读 评论(0)

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 空间复杂度或许可以利用滚动数组降低下？睡觉时候想一想，想出来了更新

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：28887次
• 积分：1057
• 等级：
• 排名：千里之外
• 原创：78篇
• 转载：10篇
• 译文：1篇
• 评论：7条
文章分类
评论排行
最新评论