题目描述:
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1
and 0
respectively in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
[ [0,0,0], [0,1,0], [0,0,0] ]
The total number of unique paths is 2
.
Note: m and n will be at most 100.
分析:
题意:给定一个m x n 二维地图(元素0代表空格、元素1代表障碍),左上角为起点,右下角为终点,一个机器人只能往下、往右走。返回到达终点所有不重复的路径条数。
思路:这道题是LeetCode 62的进化版本,我们采用动态规划的方法:我们构造数组dp[m][n],dp[i][j]表示从位置(0, 0)到达位置(i, j)的路径条数。初始化各元素值为0(其中dp[0][0] = 1,dp[i][0] = 1(i∈1→m - 1,出现该列元素为1之前),dp[0][j] = 1(j∈1→n - 1,出现该行元素为1之前)),那么对于位置(i, j),根据题意,Ⅰ. 如果地图对应值为0,那么只能从其上方或者左侧移动过来两种可能;Ⅱ. 如果地图对应值为1,说明是障碍,方式为0种。因此状态转移方程为:
dp[i][j] = (obstacleGrid[i][j] == 0)? dp[i - 1][j] + dp[i][j - 1]: 0。
时间复杂度为O(m * n)。
代码:
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
// Exceptional Case:
if(obstacleGrid.empty()){
return 0;
}
int m = obstacleGrid.size(), n = obstacleGrid[0].size();
if(obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1){
return 0;
}
// create
vector<vector<int>> dp(m, vector<int>(n, 0));
// init
dp[0][0] = 1;
int pos = 1;
while(pos <= n - 1 && obstacleGrid[0][pos] == 0){
dp[0][pos] = 1;
pos++;
}
pos = 1;
while(pos <= m - 1 && obstacleGrid[pos][0] == 0){
dp[pos][0] = 1;
pos++;
}
// dp
for(int i = 1; i <= m - 1; i++){
for(int j = 1; j <= n - 1; j++){
dp[i][j] = (obstacleGrid[i][j] == 0)? dp[i - 1][j] + dp[i][j - 1]: 0;
}
}
// get answer
return dp[m - 1][n - 1];
}
};