来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/unique-paths-ii/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int x = obstacleGrid.size();
int y = obstacleGrid[0].size();
long long dp[x][y];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < x; ++i){
if (obstacleGrid[i][0] == 1){
dp[i][0] = 0;
break;
} else
dp[i][0] = 1;
}
for (int j = 0; j < y; ++j) {
if (obstacleGrid[0][j] == 1){
dp[0][j] = 0;
break;
} else
dp[0][j] = 1;
}
for (int i = 1; i < x; i++) {
for (int j = 1; j < y; j++) {
if (obstacleGrid[i][j] == 1) {
dp[i][j] = 0;
}
else
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
return dp[x-1][y-1];
}
};
注意:dp数组使用long long定义,避免结果过大导致溢出