LeetCode 063 Unique Paths II

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