63. 不同路径 ii-爱代码爱编程

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));
        int i,j;
        if(obstacleGrid[0][0]==1||obstacleGrid[m-1][n-1]==1)return 0;
        for(i=0;i<m&& obstacleGrid[i][0] == 0;i++)
            dp[i][0]=1;
        for(i=0;i<n&& obstacleGrid[0][i] == 0;i++)
            dp[0][i]=1;
        for(i=1;i<m;i++){
            for(j=1;j<n;j++){
                if(obstacleGrid[i][j]==1)continue;
                dp[i][j]=dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
};