leetcode 之Unique Paths II

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.

Note: m and n will be at most 100.

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