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).
How many possible unique paths are there?
Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
这个题本来是想用回溯法来做,用一个count进行累加,规模小的时候可以,但规模一大就超时了。回溯法代码:
class Solution {
public:
int count;
int uniquePaths(int m, int n) {
count=0;
find(0,0,m,n);
return count;
}
void find(int row,int col,int m,int n){
if(row==m-1 && col==n-1)
count++;
if(row<m-1)
find(row+1,col,m,n);
if(col<n-1)
find(row,col+1,m,n);
}
};
于是转而用动态规划进行解题。到达每个节点的路径的总数都是到达该节点左边节点的路径总数,加上到达该节点上面节点的路径总数。设置一个初始二维数组,值都设为1,然后依次进行累加即可。
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> count(m,vector<int>(n,1));
for(int i=1;i<m;i++)
for(int j=1;j<n;j++)
count[i][j]=count[i-1][j]+count[i][j-1];
return count[m-1][n-1];
}
};
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.
这个题目是在1的里面添加了障碍物,方法还是动态规划,但是初值都赋为0.然后对第一行和第一列进行初始化。在累加的时候,判断一下当前位置是不是障碍物,如果是,就赋为0,不是再进行累加,代码如下:
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m=obstacleGrid.size();
int n=obstacleGrid[0].size();
vector<vector<int>> count(m,vector<int>(n,0));
if(obstacleGrid[0][0]==0)
count[0][0]=1;
for(int i=1;i<m;i++){
if(obstacleGrid[i][0]==0)
count[i][0]=count[i-1][0];
else
count[i][0]=0;
}
for(int j=1;j<n;j++){
if(obstacleGrid[0][j]==0)
count[0][j]=count[0][j-1];
else
count[0][j]=0;
}
for(int i=1;i<m;i++){
for(int j=1;j<n;j++){
if(obstacleGrid[i][j]==0)
count[i][j]=count[i-1][j]+count[i][j-1];
else
count[i][j]=0;
}
}
return count[m-1][n-1];
}
};