题目
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).
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.
题目大意就是说如果网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径?
分析
这是一道典型的动态规划的问题,我们使用arr[i][j]
来记录从(0,0)
到(i,j)
的路径个数,因为只能向右和向下走,所以我们很容易就能得出arr[i][j] = arr[i-1][j] + arr[i][j-1]
,即到arr[i][j]
的路径个数等于到达它上面一个方格的路劲数加上到达它左边方格的路径数。
分析
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& v) {
int m = v.size();
int n = v[0].size();
int arr[m][n];
arr[0][0] = v[0][0] == 1 ? 0 : 1;
for (int i = 0; i < m; ++i){
arr[i][0] = (v[i][0] == 0 && arr[i-1][0] == 1) ? 1 : 0;
}
for (int i = 0; i < n; ++i){
arr[0][i] = (v[0][i] == 0 && arr[0][i-1] == 1) ? 1 : 0;
}
for (int i = 1; i < m; ++i) {
for (int j = 1; j < n; ++j) {
if(v[i][j] == 1) {
arr[i][j] = 0;
}
else {
arr[i][j] = arr[i-1][j] + arr[i][j-1];
}
}
}
return arr[m-1][n-1];
}
};