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.
题目和上一篇的题目类似, 都是从左上角走到右下角,这道题用递归做会Time Limit Exceed 。迭代算法自己写了一个,程序输出是正确的,但是会报出runtime error错误 很奇怪 代码如下:
class Solution {
public:
int uniquePaths(int m, int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (m == 1 || n == 1) return 1;
int **matrix = new int *[m];
for (int i = 0; i < n; ++i)
{
matrix[i] = new int[n];
}
matrix[0][0] = 1;
for (int i = 0; i < m; ++i)
{
for (int j = 0; j < n; ++j)
{
if (i == 0 && j != 0)
{
matrix[i][j] = matrix[i][j - 1];
}
else if (i != 0 && j == 0)
{
matrix[i][j] = matrix[i - 1][j];
}
else if (i != 0 && j != 0)
{
matrix[i][j] = matrix[i - 1][j] + matrix[i][j - 1];
}
}
}
int result = matrix[m - 1][n - 1];
for (int i = 0; i < n; ++i)
{
delete[] matrix[i];
matrix[i] = NULL;
}
matrix = NULL;
return result;
}
};
能Ac的代码如下
class Solution {
public:
int uniquePaths(int m, int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.
vector<vector<int> > f(m, vector<int>(n));
for(int i = 0; i < n; i++)
f[0][i] = 1;
for(int i = 0; i < m; i++)
f[i][0] = 1;
for(int i = 1; i < m; i++)
for(int j = 1; j < n; j++)
f[i][j] = f[i-1][j] + f[i][j-1];
return f[m-1][n-1];
}
};