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]
]
 
he total number of unique paths is 2.
 
Note: m and n will be at most 100.

　　同Unique Paths的DP类似。

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int m = obstacleGrid.size();
        int n = obstacleGrid[].size();
        vector<vector<int>> grid(m, vector<int>(n,));
        for(int i = ; i< n; i++)
            if(obstacleGrid[][i] ==) grid[][i] = ;
            else break;
        for(int i = ; i< m; i++)
            if(obstacleGrid[i][] == ) grid[i][] = ;
            else break;
 
        for(int i = ; i< m; i++)
          for(int j = ; j< n; j++)
                if(obstacleGrid[i][j] == )
                   grid[i][j] = grid[i-][j] + grid[i][j-];
 
        return grid[m-][n-];
    }
};