LeetCode（63） Unique Paths II

题目：和 Unique Paths一样，只是设了路障。

Follow up for "Unique Paths":

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.

解法：和上一题一样，如果右边或下边有路障，就不加这一边就行了

代码：

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

    }
};