leetcode_72 Unique Paths II

题目：

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

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.

Note: m and n will be at most 100.

采用动态规划，有障碍物的地方dp[i][j] = 0;

 

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