leetcode 不同路径Ⅱ

动态规划

（深搜会超时）

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