leetcode

0 class Solution {

1 public:

2 int uniquePathsWithObstacles(vector<vector<int>> &obstacleGrid) {

3 int dp[101][101] = {0};

4 int n = obstacleGrid.size(), m = obstacleGrid[0].size();

5

6 for (int i = 0, flag = 0; i < n; i++) {

7 if (flag || obstacleGrid[i][0])

8 flag = true;

9 else

10 dp[i][0] = 1;

11 }

12

13 for (int i = 0, flag = 0; i < m; i++) {

14 if (flag || obstacleGrid[0][i])

15 flag = true;

16 else

17 dp[0][i] = 1;

18 }

19

20 for (int i = 1; i < n; i++) {

21 for (int j = 1; j < m; j++) {

22 if (obstacleGrid[i][j] != 1) dp[i][j] = dp[i - 1][j] + dp[i][j - 1];

23 }

24 }

25 return dp[n - 1][m - 1];

26 }

27 };