不同路径
题目链接:https://leetcode-cn.com/problems/unique-paths/submissions/
思路:最基本的二维dp,每个格子的值等于其上其左两个格子之和。
参考代码:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int> > dpTable(m, vector<int>(n, 0));
for (int i = 0; i < n; ++i) {
dpTable[0][i] = 1;
}
for (int i = 1; i < m; ++i) {
dpTable[i][0] = 1;
}
for (int i = 1; i < m; ++i) {
for (int j = 1; j < n; ++j) {
dpTable[i][j] = dpTable[i - 1][j] + dpTable[i][j - 1];
}
}
return dpTable[m - 1][n - 1];
}
};