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.

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

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