力扣题目链接
https://leetcode.cn/problems/unique-paths-ii/submissions/521296028/
记录一下初始化的技巧,第一行第一列碰到障碍物后面数值都是0,可以再for第二个条件中添加判断,不满足后跳出循环,没遍历到的值还是初值0.
for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++) {
dp[i][0] = 1;
}
for (int j = 0; j < n && obstacleGrid[0][j] == 0; j++) {
dp[0][j] = 1;
}