不同路径-动态规划62-python&c++

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:

        dp = [[0] * n for i in range(m)]
        for i in range(m):
            dp[i][0] = 1
        for j in range(n):
            dp[0][j] = 1
        
        for i in range(1, m):
            for j in range(1, n):

                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        
        return dp[-1][-1]

c++

class Solution {
public:
    int uniquePaths(int m, int n) {
        // state: dp[i][j]表示到达第i行第j列的表格的路径数
        // basecase: dp[i][0]=1, dp[0][j]=1
        // transfer: dp[i][j]=dp[i-1][j]+dp[i][j-1]
        // result: dp[m-1][n-1]

        vector<int> row(n, 1);
        vector<vector<int>> dp(m, row);

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }

        return dp[m-1][n-1];
    }
};