class Solution {
public:
int uniquePaths(int m, int n)
{
vector<vector<int>>dp(m,vector<int>(n,0));
for(int i=0;i<m;i++)
dp[i][0]=1;
for(int i=0;i<n;i++)
dp[0][i]=1;
for(int i=1;i<m;i++)
{
for(int j=1;i<n;j++)
{
dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
return dp[m-1][n-1];
}
};
路径规划2
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid)
{
int m=obstacleGrid.size();
int n=obstacleGrid[0].size();
vector<vector<int>>dp(obstacleGrid.size(),vector<int>(obstacleGrid[0].size(),0));
if(obstacleGrid[m-1][n-1]==1||obstacleGrid[0]][0]==1)
return 0;
for(int i=0;i<m&&obstacleGrid[i][0]==0;i++)
dp[i][0]=1;
for(int i=0;i<m&&obstacleGrid[0][i]==0;i++)
dp[0][i]=1;
for(int i=1;i<m;i++)
{
for(int j=1;j<n;j++)
{
if(obstacleGrid[i][j]==1)
continue;
dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
return dp[m-1][n-1];
}
};