Unique Paths
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.
class Solution {
public:
int uniquePaths(int m, int n) {
vector<int> b(m + n - 1);
b[0] = 1;
for(int i = 0; i <= m + n - 2; i++) {
for (int j = i; j > 0; j--) {
b[j] = b[j] + b[j-1];
}
}
return b[m - 1];
}
};
可以知道结果是组合数C(m + n - 2, m - 1),用分子 / 分母的方法计算组合数的中间结果会非常巨大,以本题的m, n上限来看,使用long long也会溢出。
有人提出了一种按步计算组合数的方法,使用组合数递推公式,把中间结果尽可能地变小。
另外一个问题是,乘除法尤其是除法计算量大。
解法使用 Pascal Triangle II 中使用的方法计算组合数。
附:组合数递推的解法(留坑)