63. Unique Paths II

//和上一题相比，加入一个条件，就是障碍物点出路线值为0 其余不变class Solution {public:    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {        int map[100][100]={0};        int m=obstacleGrid.size(),n=obstacleGrid[0].size();        for(int i=0;i<m;i++)            for(int j=0;j<n;j++)            {                if(obstacleGrid[i][j]==1) map[i][j]=0;                else                {                    if(i==0&&j==0) map[i][j]=1;                    else if(i==0) map[i][j]=map[i][j-1];                    else if(j==0) map[i][j]=map[i-1][j];                    else map[i][j]=map[i-1][j]+map[i][j-1];                }            }        return map[m-1][n-1];    }};