Unique Paths:m*n的格子,从左上角到右下角,总共多少条不同路线。。。
采用深搜或用stack存储要访问的格子会导致TLE,这里采用dp的方式,依据:
grid[x][y]=grid[x-1][y]+grid[x][y-1]
class Solution {
private:
int grid[100][100];
public:
int uniquePaths(int m, int n)
{
if( m <= 0 || n <= 0 )
return 0;
memset( grid, 0, sizeof( grid ));
grid[0][0] = 1;
for( int i = 0; i < m; ++i )
for( int j = 0; j < n; ++j )
{
if( (i-1) >= 0 )
grid[i][j] = grid[i-1][j];
if( (j-1) >= 0 )
grid[i][j] += grid[i][j-1];
}
return grid[m-1][n-1];
}
};
Unique Paths II:由于部分格子有obstacle,不能访问到,需要对左上角和右下角格子进行判断,即确认左上角和右下角是能访问。
class Solution {
private:
int grid[100][100];
public:
int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
if( obstacleGrid.size() <= 0 ) return 0;
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if( obstacleGrid[m-1][n-1] ) return 0;
if( m <= 0 || n <= 0 )
return 0;
memset( grid, 0, sizeof( grid ));
if( !obstacleGrid[0][0] )
grid[0][0] = 1;
for( int i = 0; i < m; ++i )
for( int j = 0; j < n; ++j )
{
if( (i-1) >= 0 && !obstacleGrid[i-1][j] )
grid[i][j] = grid[i-1][j];
if( (j-1) >= 0 && !obstacleGrid[i][j-1] )
grid[i][j] += grid[i][j-1];
}
return grid[m-1][n-1];
}
};