Unique Path Generation with obstacles

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.

 [

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

 int m  = obstacleGrid.size();
   
 if(m <= 0 )
  return 0;

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

 if(obstacleGrid[0][0] == 1)
  return 0;

   int paths[100][100];
   paths[0][0] = 1;

   for(int i = 1; i < n; i++)
    paths[0][i] = (obstacleGrid[0][i] ?  0 : paths[0][i-1]);

   for(int j = 1; j < m; j++)
    paths[j][0] = (obstacleGrid[j][0] ?  0 : paths[j-1][0]);

   for(int i = 1; i < m ; i++)
    for(int j = 1  ; j < n ; j++)
     paths[i][j]  = obstacleGrid[i][j] ?  0 :  paths[i-1][j] + paths[i][j-1];

   return paths[m-1][n-1];
}