-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathsolution063.cpp
More file actions
72 lines (62 loc) · 1.1 KB
/
solution063.cpp
File metadata and controls
72 lines (62 loc) · 1.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/**
* Unique Paths II
*
* cpselvis([email protected])
* September 13th, 2016
*/
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int> >& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if (m == 0 || n == 0 || obstacleGrid[0][0] == 1)
{
return 0;
}
vector<vector<int> > dp(m, vector<int>(n, 0));
dp[0][0] = 1;
for (int i = 1; i < m; i ++)
{
if (obstacleGrid[i][0] == 1 || dp[i - 1][0] == 0)
{
dp[i][0] = 0;
}
else
{
dp[i][0] = 1;
}
}
for (int j = 1; j < n; j ++)
{
if (obstacleGrid[0][j] == 1 || dp[0][j - 1] ==0)
{
dp[0][j] = 0;
}
else
{
dp[0][j] = 1;
}
}
for (int i = 1; i < m; i ++)
{
for (int j = 1; j < n; j ++)
{
if (obstacleGrid[i][j] == 0)
{
dp[i][j] += dp[i - 1][j];
}
if (obstacleGrid[i][j] == 0)
{
dp[i][j] += dp[i][j - 1];
}
}
}
return dp[m - 1][n - 1];
}
};
int main(int argc, char **argv)
{
}