Leetcode #63 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.

Difficulty:Medium

int uniquePathsWithObstacles(vector<vector<int> >& obstacleGrid) {
     int m = obstacleGrid[0].size();
     int n = obstacleGrid.size();
     //cout<<m<<" "<<n<<endl;
     vector<vector<int> > ans(n , vector<int>(m));
     if(obstacleGrid[0][0]==1)
        return 0;
     ans[0][0] = 1;
     for(int i = 1;i<m;i++){
        if(obstacleGrid[0][i]==1)
            ans[0][i] = 0;
        else
            ans[0][i] = ans[0][i-1];
     }
     for(int i = 1;i<n;i++){
        if(obstacleGrid[i][0]==1)
            ans[i][0] = 0;
        else
            ans[i][0] = ans[i-1][0];
     }
     if(m==1)
        return ans[n-1][0];
     if(n==1)
        return ans[0][m-1];
     for(int i = 1;i<m;i++)
        for(int j = 1;j<n;j++)
     {
         if(obstacleGrid[j][i]==1)
            ans[j][i]==0;
         else
            ans[j][i] = ans[j-1][i]+ans[j][i-1];

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